Explicit formulas for real hyperelliptic curves of genus 2 in affine representation
Author(s) -
Stefan Erickson,
Michael J. Jacobson,
Andreas Stein
Publication year - 2011
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2011.5.623
Subject(s) - mathematics , divisor (algebraic geometry) , hyperelliptic curve , affine transformation , correctness , genus , field (mathematics) , hyperelliptic curve cryptography , degenerate energy levels , pure mathematics , algebra over a field , algorithm , computer science , elliptic curve cryptography , biology , operating system , physics , quantum mechanics , encryption , public key cryptography , botany
We present a complete set of efficient explicit formulas for arithmetic in the degree $0$ divisor class group of a genus two real hyperelliptic curve given in affine coordinates. In addition to formulas suitable for curves defined over an arbitrary finite field, we give simplified versions for both the odd and the even characteristic cases. Formulas for baby steps, inverse baby steps, divisor addition, doubling, and special cases such as adding a degenerate divisor are provided, with variations for divisors given in reduced and adapted basis. We describe the improvements and the correctness together with a comprehensive analysis of the number of field operations for each operation. Finally, we perform a direct comparison of cryptographic protocols using explicit formulas for real hyperelliptic curves with the corresponding protocols presented in the imaginary model.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom