Montgomery addition for genus two curves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3076, Issue , 2004, Pages 309-317

  Lange, Tanja ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Cryptographic applications; Fast arithmetic; Hyperelliptic curves; Montgomery arithmetic

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; GEOMETRY; NUMBER THEORY;

CRYPTOGRAPHIC APPLICATIONS; FAST ARITHMETIC; GROUP OPERATIONS; HYPER-ELLIPTIC CURVES; MONTGOMERY; ODD CHARACTERISTIC; SCALAR MULTIPLICATION; SIDE-CHANNEL ANALYSIS;

SIDE CHANNEL ATTACK;

EID: 21144436640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24847-7_23     Document Type: Article

References (18)

1. R. M. Avanzi. Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations. Cryptology ePrint Archive, Report 2003/253, 2003.
2. I. F. Blake, G. Seroussi, and N. P. Smart. Elliptic curves in cryptography. London Mathematical Society Lecture Note Series. 265. Cambridge University Press, 1999.
3. E. Brier and M Joye. Weierstraß Elliptic Curves and Side-Channel Attacks. In Public Key Cryptography 2002, volume 2274 of Lect. Notes Comput. Sci., pages 335-345. Springer, 2002.
4. D. G. Cantor. Computing in the Jacobian of a hyperelliptic curve. Math. Comp., 48:95-101, 1987.
5. D. G. Cantor. On the analogue of the division polynomials for hyperelliptic curves. Journal für die reine und angewandte Mathematik, 447:91-145, 1994.
6. G. Frey and T. Lange. Mathematical Background of Public Key Cryptography. Technical Report 10, IEM Essen, 2003.
7. P. Gaudry. An algorithm for solving the discrete log problem on hyperelliptic curves. In Advances in Cryptology - Eurocrypt'2000, Lect. Notes Comput. Sci., pages 19-34. Springer, 2000.
8. M. Joye and Y. Sung-Ming. The Montgomery Powering Ladder. In Cryptographic Hardware and Embedded Systems CHES 2002, volume 2523 of Lect. Notes Comput. Sci., pages 291-302. Springer, 2002.
9. N. Koblitz. Hyperelliptic cryptosystems. J. Cryptology, 1:139-150, 1989.
10. T. Lange. Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002/147, 2002. http://eprint.iacr.org/ or http://www.itsc.ruhr-uni-bochum.de/tanja.
11. T. Lange. Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. http://www.itsc.ruhr-uni-bochum.de/tanja/preprints.html, 2003. submitted.
12. m) without precomputation. In Cryptographic Hardware and Embedded Systems CHES 99, volume 1717 of Lect. Notes Comput. Sci., pages 316-327. Springer, 1999.
13. D. Lorenzini. An Invitation to Arithmetic Geometry, volume 9 of Graduate studies in mathematics. AMS, 1996.
14. P. L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Math. Comp., 48(177):243-264, 1987.
15. D. Mumford. Tata Lectures on Theta II. Birkhäuser, 1984.
16. J. H. Silverman. The arithmetic of elliptic curves, volume 106 of Graduate texts in mathematics. Springer, 1986.
17. H. Stichtenoth. Algebraic Function Fields and Codes. Springer, 1993.
18. N. Thériault. Index calculus attack for hyperelliptic curves of small genus. In Advances in cryptology - Asiacrypt 2003, volume 2894 of Lect. Notes Comput. Sci., pages 75-92. Springer, 2003.