Aspects of hyperelliptic curves over large prime fields in software implementations

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

Volumn 3156, Issue , 2004, Pages 148-162

  Avanzi, Roberto Maria ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Cryptography; Efficient implementation; Elliptic and hyperelliptic curves; Lazy and incomplete modular reduction; Prime field arithmetic

Indexed keywords

CRYPTOGRAPHY; EMBEDDED SYSTEMS;

ARITHMETIC LIBRARY; CURVE-BASED CRYPTOGRAPHY; EFFICIENT IMPLEMENTATION; GROUP OPERATIONS; HYPER-ELLIPTIC CURVES; MODULAR REDUCTION; PRIME FIELD; SOFTWARE IMPLEMENTATION;

GEOMETRY;

EID: 35048858891     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28632-5_11     Document Type: Article

References (41)

1. AMD Corporation. AMD-K6-2 Processor Data Sheet, http://www.amd.com/ US-en/assets/content-type/White_papers_and_tech-docs/21850.pdf
2. R.M. Avanzi. Coimtenneasures against differential power analysis for hyperelliptic curve cryptosystems. Proc. CHES 2003. LNCS 2779, 366-381. Springer, 2003.
3. R.M. Avanzi and P.M. Mihäilescu. Generic Efficient Arithmetic Algorithms for PAFFs (Processor Adequate Finite Fields) and Related Algebraic Structures. Proc. SAC 2003. LNCS 3006, 320-334. Springer 2004.
4. R.M. Avanzi. A note on the sliding window integer recoding and its left-to-right analogue. Submitted.
5. A. Bosselaers, R. Govaerts and J. Vandewalle. Comparison of three modular reduction functions. Proc. Crypto '93. LNCS 773, 175-186. Springer, 1994.
6. M.K. Brown, D. Hankerson, J, Lopez and A. Menezes. Software implementation of the NIST elliptic curves over prime fields. Proc. CT-RSA 2001. LNCS 2020, 250-265. Springer, 2001.
7. D. Cantor. Computing in the Jacobian of a Hyperelliptic Curve. Math. Comp. 48 (1987), 95-101.
8. H. Cohen, A. Miyaji and T. Ono. Efficient elliptic curve exponentiation. Proc. ICICS 1997, LNCS 1334, 282-290. Springer, 1997.
9. H. Cohen, A. Miyaji and T. Ono. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Proc. ASIACRYPT 1998. LNCS 1514, 51-65. Springer, 1998.
10. P.G. Comba. Exponentiation cryptosystems on the IBM PC. IBM Systems Journal, 29 (Oct. 1990), 526-538.
11. S.R. Dussé and B.S. Kaliski. A cryptographic library for the Motorola DSP56000. Proc. EUROCRYPT '90. LNCS 473, 230-244. Springer, 1991.
12. P. Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves. Proc. EUROCRYPT 2000. LNCS 1807, 19-34. Springer, 2000.
13. P. Gaudry and E. Schost. Construction of Secure Random Curves of Genus 2 over Prime Fields. Proc. EUROCRYPT 2004. LNCS 3027, 239-256. Springer, 2004.
14. M. Gonda, K. Matsuo, K. Aoki, J. Chao, and S. Tsuji. Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementations. Proc. SCIS 2004, 995-1000.
15. D.M. Gordon. A survey of fast exponentiation methods. J. of Algorithms 27 (1998), 129-146.
16. T. Grandlund. GMP. A software library for arbitrary precision integers. Available from: http://www.swox.com/gmp/
17. R. Harley. Fast Arithmetic on Genus Two Curves. Available at http : //cristal. inria.fr/~harley/hyper/
18. T. Jebelean. A Generalization of the Binary GCD Algorithm. Proc. ISSAC 1993, 111-116.
19. B.S. Kaliski Jr.. The Montgomery inverse and its applications. IEEE Transactions on Computers, 44(8), 1064-1065, August 1995.
20. A. Karatsuba and Y. Ofman. Multiplication of Multidigit Numbers on Automata, Soviet Physics - Doklady, 7 (1963), 595-596.
21. N. Koblitz. Hyperelliptic Cryptosystems. J. of Cryptology 1 (1989), 139-150.
22. U. Krieger, signature. c : Anwendung hyperelliptischer Kurven in der Kryptographie. M.S. Thesis, Mathematik und Informatik, Universität Essen, Fachbereich 6, Essen, Germany.
23. T. Lange. Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. Cryptology ePrint Archive, Report 2002/121, 2002. http : //eprint.iacr.org/
24. T. Lange. Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. To appear in: J. AAECC.
25. A.K. Lenstra and E.R. Verheul. Selecting Cryptographic Key Sizes. J. of Cryptology 14 (2001), 255-293.
26. R. Lercier. Algorithmique des courbes elliptiques dans les corps finis These. Available from http: //www.medicis.polytechnique. fr/~lercier/
27. m). Proc. PKC 2000, LNCS 1751, 405-421. Springer 2000.
28. A. Menezes, Y.-H. Wu and R. Zuccherato. An Elementary Introduction to Hyperelliptic Curves. In N. Koblitz, Algebraic aspects of cryptography. Springer, 1998.
29. J.-F. Mestre. Construction des courbes de genre 2 a partir de leurs modules. Progr. Math. 94 (1991), 313-334.
30. Y. Miyamoto, H. Doi, K. Matsuo, J. Chao, and S. Tsuji. A Fast Addition Algorithm of Genus Two Hyperelliptic Curve. Proc. SCIS 2002, IEICE Japan, 497-502, 2002. In Japanese.
31. P.L. Montgomery. Modular multiplication without trial division. Math. Comp. 44 (1985), 519-521.
32. J. Pelzl. Fast Hyperelliptic Curve Cryptosystems for Embedded Processors. Master's Thesis. Dept. of Elec. Eng. and Infor. Sci., Ruhr-University of Bochum, 2002.
33. J. Pelzl, T. Wollinger, J. Guajardo, J. and C. Paar. Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves. CHES 2003, LNCS 2779, 351-365. Springer, 2003.
34. G.W. Reitwiesner. Binary arithmetic. Advances in Computers 1 (1960), 231-308.
35. Y. Sakai, and K. Sakurai. On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation. IEICE-Tran. Fund. Elec., Comm. and Comp. Sci. Vol. E83-A No.4., 692-703.
36. N.P. Smart. On the Performance of Hyperelliptic Cryptosystems. Proc. EUROCRYPT '99, LNCS 1592, 165-175. Springer, 1999.
37. J.A. Solinas. An improved algorithm for arithmetic on a family of elliptic curves. Proc. CRYPTO '97, LNCS 1294, 357-371. Springer, 1997.
38. N. Thériault. Index calculus attack for hyperelliptic curves of small genus. Proc. Asiacrypt 2003. LNCS 2894, 75-92. Springer, 2003.
39. A. Weng. Konstruktion kryptographisch geeigneter Kurven mit komplexer Multiplikation. PhD thesis, Universität Gesamthochschule Essen, 2001.
40. T. Wollinger, J. Pelzl, V. Wittelsberger, C. Paar, G. Saldamli, and Ç.K. Koç. Elliptic & Hyperelliptic Curves on Embedded μP. Special issue on Embedded Systems and Security of the ACM Transactions in Embedded Computing Systems.
41. T. Wollinger. Engineering Aspects of Hyperelliptic Curves. Ph.D. Thesis. Dept. of Elec. Eng. and Infor. Sci., Ruhr-University of Bochum. July 2004.