Koblitz curve cryptosystems

Finite Fields and their Applications

Volumn 11, Issue 2, 2005, Pages 200-229

  Lange, Tanja ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Cryptography; Discrete logarithm systems; Frobenius expansions; Hyperelliptic curves; Koblitz curves

Indexed keywords

ALGORITHMS; POLYNOMIALS; SECURITY OF DATA; THEOREM PROVING; VECTORS;

DISCRETE LOGARITHM SYSTEMS; FROBENIUS EXPANSIONS; HYPERELLIPTIC CURVES; KOBLITZ CURVES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 15544386455     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ffa.2004.07.001     Document Type: Article

References (50)

1. ab curve and their application to discret-log-based public key cryptosystems, in: The Mathematics of Public Key Cryptography, Fields Institute, Toronto, 1999, pp. 1291-1299.
2. 3,4 curves, in: Algorithmic Number Theory Seminar ANTS-VI, Lecture Notes in Computer Science, vol. 3076, Springer, Berlin, 2004, pp. 87-101.
3. D. Boneh, R. Venkatesan, Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes, in: Advances in Cryptology-Crypto '96, Lecture Notes in Computer Science, vol. 1109, Springer, Berlin, 1996, pp. 129-142.
4. D.G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Math. Comp. 48 (1987) 95-101.
5. Y. Choie, J.W. Lee, Speeding up the scalar multiplication in the Jacobian of hyperelliptic curves using Frobenius map, in: Progress in Cryptology-Indocrypt 2002, Lecture Notes in Computer Science, vol. 2551, Springer, Berlin, 2002, pp. 285-295.
6. M. Coster A. Joux B. LaMacchia A. Odlyzko C.-P. Schnorr J. Stern Improved low-density subset sum algorithms Comp. Compl. 2 (1992) 111-128.
7. W. Diffie, M.E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory 22 (6) (1976) 644-654.
8. I. Duursma, P. Gaudry, F. Morain, Speeding up the discrete log computation on curves with automorphisms, in: Advances in cryptology-Asiacrypt'99, Lecture Notes in Computer Science, vol. 1716, Springer, Berlin, 1999, pp. 103-121.
9. T. ElGamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory 31 (4) (1985) 469-472.
10. U. Finke, M. Pohst, Methods for calculating vectors of short length in a lattice, Math. Comput. 44 (1985) 463-482.
11. S. Flon, R. Oyono, Fast arithmetic on Jacobians of Picard curves, in: Public Key Cryptography-PKC 2004, Lecture Notes in Computer Science, vol. 2947, Springer, Berlin, 2004, pp. 55-68.
12. S. Flon, R. Oyono, C. Ritzenthaler, Fast addition on non-hyperelliptic genus 3 curves, cryptology ePrint Archive, Report 2004/118 (2004).
13. G. Frey, T. Lange, Mathematical Background of Public Key Cryptography, Technical Report, vol. 10, IEM Essen, 2003.
14. G. Frey H.G. Rück A remark concerning m -divisibility and the discrete logarithm problem in the divisor class group of curves, Math. Comp. 62 (1994) 865-874.
15. S.D. Galbraith, Supersingular curves in cryptography, in: Advances in Cryptology-Asiacrypt 2001, Lecture Notes in Computer Science, vol. 2248, Springer, Berlin, 2001, pp. 495-513.
16. S.D. Galbraith, Weil descent of Jacobians, in: D. Augot, C. Carlet (Eds.), WCC2001, Electronic Notes in Discrete Mathematics, vol. 6, Elsevier, Amsterdam, 2001, < http://www.elsevier.nl/gej-g/31/29/24/ show/Products/notes/index.htt >.
17. P. Gaudry F. Hess N.P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, J. Cryptol. 15 (1) (2002) 19-46. < http://www.hpl.hp.com/techreports/2000/HPL-2000-10.html >.
18. P. Gaudry, E. Schost, Construction of secure random curves of genus 2 over prime fields, in: Advances in Cryptology-Eurocrypt'2004, Lecture Notes in Computer Science, vol. 3027, Springer, Berlin, 2004, pp. 239-256.
19. C. Günther, T. Lange, A. Stein, Speeding up the arithmetic on Koblitz curves of genus two, in: Selected Areas in Cryptography-SAC 2000, Lecture Notes in Computer Science, vol. 2012, Springer, Berlin, 2000, pp. 106-117.
20. D. Hankerson, J. Hernandez, A. Menezes, Software implementation of elliptic curve cryptography over binary fields, in: Cryptographic Hardware and Embedded Systems CHES 2000, Lecture Notes in Computer Science, vol. 1965, Springer, Berlin, 2000, pp. 1-24.
21. F. Hess, G. Seroussi, N.P. Smart, Two topics in hyperelliptic cryptography, in: Selected Areas in Cryptography-SAC 2001, Lecture Notes in Computer Science, vol. 2259, Springer, Berlin, 2001, pp. 181-189.
22. N.G. Howgrave-Graham N.P. Smart Lattice attacks on digital signature schemes Des. Codes Cryptography 23 2001 283-290
23. N. Koblitz Hyperelliptic cryptosystems J. Cryptology 1 1989 139-150
24. N. Koblitz, CM-curves with good cryptographic properties, in: Advances in Cryptology - Crypto'91, Lecture Notes in Computer Science, vol. 576, Springer, Berlin, 1992, pp. 279-287.
25. J. Kuroki, M. Gonda, K. Matsuo, J. Chao, S. Tsuji, Fast genus three hyperelliptic curve cryptosystems, in: Proceedings of SCIS2002, IEICE, Japan, 2002, pp. 503-507.
26. T. Lange, Efficient arithmetic on hyperelliptic Koblitz curves, Technical Report 2-2001, University Essen, 2001.
27. T. Lange, Hyperelliptic curves allowing fast arithmetic, 2001, < http://www.itsc.ruhr.uni-bochum.de/tanja/KoblitzC.html >.
28. T. Lange, Efficient arithmetic on hyperelliptic curves, Ph.D. Thesis, University Essen, 2001.
29. T. Lange, Formulae for arithmetic on genus 2 hyperelliptic curves, http://www.itsc.ruhr-uni-bochum.de/tanja/preprints.html, J. AAECC (2004), to appear.
30. 2n, in preparation.
31. T. Lange, I. Shparlinski, Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves, J. AAECC (2004), to appear.
32. J.-L. Lesage, Equations diophantiennes et corps quadratiques, Ph.D. Thesis, Université de Caen, 1998.
33. D. Lorenzini, An invitation to Arithmetic Geometry, Graduate Studies in Mathematics, vol. 9, American Mathematical Society, Providence, RI, 1996.
34. A. Menezes T. Okamoto S. Vanstone Reducing elliptic curve logarithms to a finite field IEEE Trans. Inform. Theory 39 1993 1639-1646
35. A. Menezes P. van Oorschot S. Vanstone Handbook of Applied Cryptography 1996 CRC Press Boca Raton, FL
36. A. Menezes, M. Qu, Analysis of the Weil descent attack of Gaudry, Hess and Smart, preprint.
37. A.J. Menezes, S. Vanstone, The implementation of elliptic curve cryptosystems, in: Advances in cryptology-AUSCRYPT '90, Lecture Notes in Computer Science, vol. 453, Springer, Berlin, 1990, pp. 2-13.
38. A.J. Menezes, Y.-H. Wu, R. Zuccherato, An elementary introduction to hyperelliptic curves, in: N. Koblitz (Ed.), Algebraic Aspects of Cryptography, Springer, Berlin, 1998, pp. 155-178.
39. W. Meier, O. Staffelbach, Efficient multiplication on certain nonsupersingular elliptic curves, in: Advances in Cryptology-Crypto'92, Lecture Notes in Computer Science, vol. 740, Springer, Berlin, 1993, pp. 333-344.
40. V. Müller, Fast multiplication on elliptic curves over small fields of characteristic two, J. Cryptol. 11 (1998) 219-234.
41. P.Q. Nguyen, I.E. Shparlinksi, The insecurity of the elliptic curve digital signature algorithm with partially known nonces, Des. Codes Cryptography 30 (2003) 201-217.
42. P.Q. Nguyen, J. Stern, The hardness of the hidden subset sum problem and its cryptographic implications, in: Advances in Cryptology-Crypto '99, Lecture Notes in Computer Science, vol. 1666, Springer, Berlin, 1999, pp. 31-46.
43. Y.-H. Park, S. Jeong, J. Lim, Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms, in: Advances in Cryptology-Eurocrypt 2002, Lecture Notes in Computer Science, vol. 2332, Springer, Berlin, 2002, pp. 197-208.
44. J. Pelzl, Fast hyperelliptic curve cryptosystems for embedded processors, Master's Thesis, Ruhr-University of Bochum, 2002.
45. N.P. Smart, Elliptic curve cryptosystems over small fields of odd characteristic, J. Cryptol. 12 (1999) 141-151.
46. J. Solinas, An improved algorithm for arithmetic on a family of elliptic curves, in: Advances in Cryptology-Crypto '97, Lecture Notes in Computer Science, vol. 1294, Springer, Berlin, 1997, pp. 371-375.
47. J. Solinas, Efficient arithmetic on Koblitz curves, Designs Codes Cryptography 19 (2000) 195-249.
48. q, cryptology ePrint Archive, Report 2004/030 (2004).
49. H. Stichtenoth, Algebraic Function Fields and Codes, Springer, Berlin, 1993.
50. M. Wiener, R. Zuccherato, Faster attacks on elliptic curve cryptosystems, in: Selected Areas in Cryptography-SAC'98, Lecture Notes in Computer Science, vol. 1556, Springer, Berlin, 1998, pp. 190-200.