Advertisement
Published in:
2009 | OriginalPaper | Chapter
Faster Halvings in Genus 2
Authors : Peter Birkner, Nicolas Thériault
Published in: Selected Areas in Cryptography
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We study divisor class halving for hyperelliptic curves of genus 2 over binary fields. We present explicit halving formulas for the most interesting curves (from a cryptographic perspective), as well as all other curves whose group order is not divisible by 4. Each type of curve is characterized by the degree and factorization form of the polynomial
h
(
x
) in the curve equation. For each of these curves, we provide explicit halving formulæ for all possible divisor classes, and not only the most frequent case where the degree of the first polynomial in the Mumford representation is 2. In the optimal performance case, where
h
(
x
) =
x
, we also improve on the state-of-the-art and when
h
(
x
) is irreducible of degree 2, we achieve significant savings over both the doubling as well as the previously fastest halving formulas.