Elliptic curve cryptography: The serpentine course of a paradigm shift

Journal of Number Theory

Volumn 131, Issue 5, 2011, Pages 781-814

  Koblitz, Ann Hibner ^a   Koblitz, Neal ^b   Menezes, Alfred ^c  

^a ARIZONA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

01A80; 11T71; 14G50; 68P25; 94A60; Cryptography; Elliptic curve; Public key; Social construction of science; Social construction of technology

Indexed keywords

EID: 79551608946     PISSN: 0022314X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jnt.2009.01.006     Document Type: Article

References (109)

1. Adleman L., DeMarrais J., Huang M. A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. Lecture Notes in Comput. Sci. 1994, vol. 877:28-40. Springer-Verlag.
2. Agrawal D., Archambeault B., Rao J., Rohatgi P. The EM side-channel(s). Lecture Notes in Comput. Sci. 2002, vol. 2523:29-45.
3. American National Standards Institute (ANSI) X9.62, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1999.
4. Balasubramanian R., Koblitz N. The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm. J. Cryptology 1998, 11:141-145.
5. Belenky M., et al. Women's Ways of Knowing: The Development of Self, Voice, and Mind 1986, Basic Books.
6. Bellare M. Practice-oriented provable-security. Lecture Notes in Comput. Sci. 1998, vol. 1396:221-231.
7. Berg A.-J. A gendered socio-technical construction: The smart house. The Social Shaping of Technology 1999, 301-313. Open Univ. Press. second ed.
8. Boneh D., Boyen X. Short signatures without random oracles and the SDH assumption on bilinear groups. J. Cryptology 2008, 21:149-177.
9. Boneh D., DeMillo R., Lipton R. On the importance of checking cryptographic protocols for faults. Lecture Notes in Comput. Sci. 1997, vol. 1233:37-51.
10. Boneh D., Franklin M. Identity-based encryption from the Weil pairing. SIAM J. Comput. 2003, 32:586-615.
11. Boneh D., Lynn B., Shacham H. Short signatures from the Weil pairing. Lecture Notes in Comput. Sci. 2001, vol. 2248:514-532.
12. Boyen X., Martin L. Identity-Based Cryptography Standard (IBCS) #1: Supersingular curve implementations of the BF and BB1 cryptosystems, IETF RFC available from. http://www.ietf.org/rfc/rfc5091.txt.
13. Braun E., Macdonald S. Revolution in Miniature: The History and Impact of Semiconductor Electronics 1978, Cambridge Univ. Press.
14. Bricmont J., Sokal A. Fashionable Nonsense: Postmodern Intellectuals' Abuse of Science 1998, St. Martin's Press.
15. Bröker R., Charles D., Lauter K. Evaluating large degree isogenies and applications to pairing based cryptography. Lecture Notes in Comput. Sci. 2008, vol. 5209:100-112.
16. Brown D., Gallant R. The static Diffie-Hellman problem http://eprint.iacr.org/2004/306/.
17. Cheon J. Security analysis of the strong Diffie-Hellman problem. Lecture Notes in Comput. Sci. 2006, vol. 4004:1-11.
18. Coppersmith D. Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inform. Theory 1984, 30:587-594.
19. What If? The World's Foremost Military Historians Imagine What Might Have Been 2000, Berkley Trade. R. Cowley (Ed.).
20. Diem C. An index calculus algorithm for plane curves of small degree. Lecture Notes in Comput. Sci. 2006, vol. 4076:543-557.
21. C. Diem, On arithmetic and the discrete logarithm problem in class groups of curves, Habilitationsschrift, Universität Leipzig, available from http://www.math.uni-leipzig.de/~diem/preprints/habil.pdf.
22. Diem C., Gaudry P., Thériault N., Thomé E. A double large prime variation for small genus hyperelliptic index calculus. Math. Comp. 2007, 76:475-492.
23. Diem C., Thomé E. Index calculus in class groups of non-hyperelliptic curves of genus three. J. Cryptology 2008, 21:593-611.
24. Diffie W., Hellman M. New directions in cryptography. IEEE Trans. Inform. Theory 1976, 22:644-654.
25. Diffie W., Landau S. Privacy on the Line: The Politics of Wiretapping and Encryption 2007, MIT Press. second ed.
26. Elliott B. Introduction, Technology and Social Process 1988, Edinburgh Univ. Press, pp. 1-7.
27. Virtual History: Alternatives and Counterfactuals 1997, Picador. N. Ferguson (Ed.).
28. Frey G., Rück H. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 1994, 62:865-874.
29. Galbraith S. Constructing isogenies between elliptic curves over finite fields. LMS J. Comput. Math. 1999, 2:118-138.
30. Galbraith S., Rotger V. Easy decision Diffie-Hellman groups. LMS J. Comput. Math. 2004, 7:201-218.
31. Gallant R., Lambert R., Vanstone S. Improving the parallelized Pollard lambda search on an anomalous binary curve. Math. Comp. 2000, 69:1699-1705.
32. P. Gaudry, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, J. Symbolic Comput., in press, available from http://www.loria.fr/~gaudry/papers.en.html.
33. Gaudry P., Hess F., Smart N. Constructive and destructive facets of Weil descent on elliptic curves. J. Cryptology 2002, 15:19-34.
34. Gilligan C. In a Different Voice: Psychological Theory and Women's Development 1982, Harvard Univ. Press.
35. Goldreich O. On post-modern cryptography available from. http://eprint.iacr.org/2006/461/.
36. Gordon D. Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math. 1993, 6:124-138.
37. Gross P., Levitt N. Higher Superstition: The Academic Left and Its Quarrels with Science 1994, Johns Hopkins Univ. Press.
38. Haraway D. Primate Visions: Gender, Race, and Nature in the World of Modern Science 1989, Routledge.
39. Haraway D. Race: Universal Donors in a Vampire Culture. The Haraway Reader 2003, Routledge, pp. 251-293.
40. Hess F. Generalizing the GHS attack on the elliptic curve discrete logarithm problem. LMS J. Comput. Math. 2004, 7:167-192.
41. Holton G. Science and Anti-Science 1993, Harvard Univ. Press.
42. Hrdy S. The Woman That Never Evolved 1981, Harvard Univ. Press.
43. Hughes T. The seamless web: Technology, science, et cetera, et cetera. Technology and Social Processes 1988, 9-19. Edinburgh Univ. Press.
44. Hughes T. Edison and electric light. The Social Shaping of Technology 1999, 50-63. Open Univ. Press. second ed.
45. Ireland K., Rosen M. A Classical Introduction to Modern Number Theory 1990, Springer-Verlag. second ed.
46. Jacobson M., Koblitz N., Silverman J., Stein A., Teske E. Analysis of the xedni calculus attack. Des. Codes Cryptogr. 2000, 20:41-64.
47. Jao D., Miller S., Venkatesan R. Do all elliptic curves of the same order have the same difficulty of discrete log?. Lecture Notes in Comput. Sci. 2005, vol. 3788:21-40.
48. Joux A. A one round protocol for tripartite Diffie-Hellman. Lecture Notes in Comput. Sci. 2000, vol. 1838:385-393.
49. Katz J., Lindell Y. Introduction to Modern Cryptography 2007, CRC Press.
50. Kline R., Pinch T. The social construction of technology. The Social Shaping of Technology 1999, 113-115. Open Univ. Press. second ed.
51. Koblitz A.H. A historian looks at gender and science. Internat. J. Sci. Ed. 1987, 9:399-407.
52. Koblitz A.H. Male bonding around the campfire: Constructing myths of Hohokam militarism. Men Masculinities 2006, 9:95-107.
53. Koblitz A.H. Warriors, campfires, and a big stick: Modern male fantasies of Hohokam militarism. Bull. Old Pueblo Archaeology Center 2008, 53:2-5.
54. Koblitz N. Elliptic curve cryptosystems. Math. Comp. 1987, 48:203-209.
55. Koblitz N. Hyperelliptic cryptosystems. J. Cryptology 1989, 1:139-150.
56. Koblitz N. CM-curves with good cryptographic properties. Lecture Notes in Comput. Sci. 1992, vol. 576:279-287.
57. Koblitz N. An elliptic curve implementation of the finite field Digital Signature Algorithm. Lecture Notes in Comput. Sci. 1998, vol. 1462:327-337.
58. Koblitz N., Menezes A. Pairing-based cryptography at high security levels. Lecture Notes in Comput. Sci. 2005, vol. 3796:13-36.
59. Koblitz N., Menezes A. Another look at 'provable security'. II. Lecture Notes in Comput. Sci. 2006, vol. 4329:148-175.
60. Koblitz N., Menezes A. Another look at 'provable security'. J. Cryptology 2007, 3-37.
61. Koblitz N., Menezes A. Another look at generic groups. Adv. Math. Commun. 2007, 1:13-28.
62. Koblitz N., Menezes A. Another look at non-standard discrete log and Diffie-Hellman problems. J. Math. Cryptol. 2008, 2:311-326.
63. Kocher P. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. Lecture Notes in Comput. Sci. 1996, vol. 1109:104-113.
64. Kocher P., Jaffe J., Jun B. Differential power analysis. Lecture Notes in Comput. Sci. 1999, vol. 1666:388-397.
65. D. Kohel, Endomorphism rings of elliptic curves over finite fields, PhD thesis, Univ. of California at Berkeley, 1996.
66. Kraitchik M. Théorie des nombres, vol. 1 1922, Gauthier-Villars.
67. Kraitchik M. Recherches sur la théorie des nombres 1924, Gauthier-Villars.
68. Kuhn T. The Structure of Scientific Revolutions 1962, Univ. of Chicago Press.
69. Landau S. Communications security for the twenty-first century: The Advanced Encryption Standard. Notices Amer. Math. Soc. 2000, 47:450-459.
70. Lenstra H.W. Factoring integers with elliptic curves. Ann. of Math. 1987, 126:649-673.
71. Lenstra A.K., Verheul E.R. The XTR public key system. Lecture Notes in Comput. Sci. 2000, vol. 1880:1-19.
72. Levy S. Crypto: How the Code Rebels Beat the Government - Saving Privacy in the Digital Age 2001, Viking Penguin.
73. M. Lochter, J. Merkle, ECC Brainpool standard curves and curve generation, IETF Internet-Draft, February 18, 2008.
74. MacKenzie D., Wajcman J. Preface to the second edition, and Introductory essay: The social shaping of technology. The Social Shaping of Technology 1999, Open Univ. Press, pp. xiv-xvi and 3-27. second ed.
75. L. Martin, A closer look at pairings, presentation at the NIST workshop "Applications of Pairing Based Cryptography: Identity Based Encryption and Beyond", June 3-4, 2008, available from http://csrc.nist.gov/groups/ST/IBE/documents/June08.
76. Menezes A., Okamoto T., Vanstone S. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory 1993, 39:1639-1646.
77. Menezes A., Qu M. Analysis of the Weil descent attack of Gaudry, Hess and Smart. Lecture Notes in Comput. Sci. 2001, vol. 2020:308-318.
78. Menezes A., Teske E. Cryptographic implications of Hess' generalized GHS attack. Appl. Algebra Engrg. Comm. Comput. 2006, 16:439-460.
79. Menezes A., Teske E., Weng A. Weak fields for ECC. Lecture Notes in Comput. Sci. 2004, vol. 2964:366-386.
80. Miller V. Uses of elliptic curves in cryptography. Lecture Notes in Comput. Sci. 1986, vol. 218:417-426.
81. V. Miller, Short programs for functions on curves, unpublished manuscript, 1986.
82. Miller V. The Weil pairing, and its efficient calculation. J. Cryptology 2004, 17:235-261.
83. Miyaji A., Nakabayashi M., Takano S. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Trans. Fundamentals 2001, E84-A:1234-1243.
84. D. Moody, The Diffie-Hellman problem and generalization of Verheul's theorem, PhD thesis, Univ. of Washington, 2009.
85. Müller V. Fast multiplication on elliptic curves over small fields of characteristic two. J. Cryptology 1998, 11:219-234.
86. National Institute of Standards and Technology, Digital Signature Standard, Federal Information Processing Standards Publication 186-2, 2000.
87. National Security Agency, The case for elliptic curve cryptography, http://www.nsa.gov/ia/industry/crypto_elliptic_curve.cfm.
88. Pohlig S., Hellman M. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory 1978, 24:106-110.
89. Pollard J. Monte Carlo methods for index computation mod p. Math. Comp. 1978, 32:918-924.
90. Sakai R., Ohgishi K., Kasahara M. Cryptosystems based on pairings. Proceedings of the 2000 Symposium on Cryptography and Information Security 2000, Okinawa.
91. Schirokauer O. The number field sieve for primes of low hamming weight available from. http://eprint.iacr.org/2006/107.
92. Schoof R. Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp. 1985, 44:483-494.
93. Semaev I. Summation polynomial and the discrete logarithm on elliptic curves http://eprint.iacr.org/2004/031/.
94. Shamir A. Identity-based cryptosystems and signature schemes. Lecture Notes in Comput. Sci. 1985, vol. 196:277-296.
95. Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 1997, 26:1484-1509.
96. Silverman J. The Arithmetic of Elliptic Curves 1986, Springer-Verlag.
97. Silverman J. The xedni calculus and the elliptic curve discrete logarithm problem. Des. Codes Cryptogr. 2000, 20:5-40.
98. J. Silverman, The four faces of lifting for the elliptic curve discrete logarithm problem, in: 11th Workshop on Elliptic Curve Cryptography, Univ. College Dublin, September 5, 2007, available from http://mathsci.ucd.ie/~gmg/ECC2007Talks.
99. Silverman J., Suzuki J. Elliptic curve discrete logarithms and the index calculus. Lecture Notes in Comput. Sci. 1998, vol. 1514:110-125.
100. Smith B. Isogenies and the discrete logarithm problem in jacobians of genus 3 hyperelliptic curves. Lecture Notes in Comput. Sci. 2008, vol. 4965:163-180.
101. Sokal A. Transgressing the boundaries: Toward a transformative hermeneutics of quantum gravity. Social Text 1996, 46/47:217-252.
102. Sokal A. Beyond the Hoax: Science, Philosophy and Culture 2008, Oxford Univ. Press.
103. Solinas J. Efficient arithmetic on Koblitz curves. Des. Codes Cryptogr. 2000, 19:195-249.
104. Primate Encounters: Models of Science, Gender, and Society 2000, Univ. of Chicago Press. S. Strum, L. Fedigan (Eds.).
105. Verheul E. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. Lecture Notes in Comput. Sci. 2001, vol. 2045:195-210.
106. Verheul E. Evidence that XTR is more secure than supersingular elliptic curve cryptosystems. J. Cryptology 2004, 17:277-296.
107. Washington L. Elliptic Curves: Number Theory and Cryptography 2008, CRC Press. second ed.
108. Wiener M., Zuccherato R. Faster attacks on elliptic curve cryptosystems. Lecture Notes in Comput. Sci. 1999, vol. 1556:190-200.
109. Wolf D. Assurance provider: Designing a roadmap for information security http://www.military-information-technology.com/article.cfm?DocID=1294.