Overview of elliptic curve cryptography

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

Volumn 1431, Issue , 1998, Pages 29-49

  Araki, Kiyomichi ^a   Satoh, Takakazu ^b   Miura, Shinji ^c  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b SAITAMA UNIVERSITY   (Japan)

^c SONY CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; PUBLIC KEY CRYPTOGRAPHY;

CRYPTOGRAPHIC SCHEMES; DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; FINITE FIELDS; MINIMUM REQUIREMENTS;

CRYPTOGRAPHY;

EID: 0040518412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0054012     Document Type: Conference Paper

References (76)

1. L. M. Adleman: A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. of FOCS, pp.56-60(1979)
2. L. M. Adleman, J. DeMarrais, M.-D. Huang: A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyper-elliptic curves over finite fields, in Algorithmic number theory (Ithaca, NY, 1994), Lecture Notes in Comput. Sci., 877(1994), 28-40, Springer: Berlin.
3. A.O.L. Atkin, F. Morain: Elliptic curves and primality proving, Math. Comp. 61(1993), 29-68.
4. E. Artin: Quadratische Korper im Gebiet der hoheren Kongruenzen, Math. Z., 19(1924) 153-246.
5. R. Balasubramanian, N. Koblitz: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm, preprint (1996), to appear in J. Cryptology.
6. E. Berlekamp: Factoring polynomials over large finite fields, Math. Comp. 24(1970), 713-735.
7. T. Beth, F. Schaefer: Non supersingular elliptic curves for public key cryptosystems, Proc. EUROCRYPT'91, Lect. Notes in Comput. Sci. vol.547(1991), 316-327
8. J.W.S. Cassels: Diophantine equations with special reference to elliptic curves, J. London Math. Soc, 41(1966) 193-291. Corrigenda: 42(1967) 183
9. J.W.S. Cassels: Lectures on elliptic curves, London Math. Soc. student texts vol. 24(1991), Cambridge UP: Cambridge
10. J.-M. Couveignes, F. Morain: Schoof's algorithm and isogeny cycles, in Algorithmic number theory (Ithaca, NY, 1994), Lecture Notes in Comput. Sci., 877(1994), 43-58, Springer: Berlin.
11. H. Cohen: A course in computational algebraic number theory, GTM vol. 138(1993) Springer: Berlin.
12. D. Coppersmith: Fast evalution of logarithms in fields of characteristics two, IEEE Trans. Info. Theory, IT-30(1984), 587-594
13. D. Cantor, H. Zassenhaus: A new algorithm for factoring polynomials over finite fields, Math. Comp. 36(1981), 587-592
14. P. Deligne: La conjecture de Weil, I. Publ. IHES, 43(1974) 273-307
15. P. Deligne: La conjecture de Weil, II. Publ. IHES, 52(1980) 137-252
16. M. Deuring: Die Typen der Multiplikatorenringe elliptischer Funktionenkorper, Abh. Math. Sem. Hamburg, 14(1941) 197-272
17. D.E. Diffie and M. Hellman: New directions in cryptography, IEEE Trans. Info. Theory, IT-22(1976), 644-654
18. B. Dwork: On the rationality of the zeta-function of an algebraic variety. Amer. J. Math., 82(1960) 631-648
19. T. El Gamal: A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Info. Theory, IT-31(1985), 469-472
20. G. Faltings: Endlichkeitssatze fiir Abelsche Varietaten fiber Zahlkorpern, Invent. Math., 73(1983), 349-366
21. G. Frey, H.-G. Ruck: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 62(1994) 865-874
22. W. Fulton: Algebraic curves (1969), Benjamin: Menlo Park
23. D. M. Gordon: Designing and detecting trapdoors for discrete log cryptosystems, Proc. of CRYPTO'92, LNCS 740(1992), pp. 66-75
24. A. Grothendieck: Cohomologie /-adique et fonctions L (SGA5), Lect. Notes in Math. vol. 589, Springer-Verlag: Berlin. (1977)
25. R. Hartshorne: Algebraic geometry, GTM vol. 52(1977), Springer-Verlag: Berlin
26. H. Hasse: Zur Theorie der abstrakten elliptischen Funktionenkdrper, III, J. Reine Angew. Math., 175(1936), 193-208
27. T. Honda: Isogeny classes of abelian varieties over finite fields, J. Math. Soc. Japan, 20(1968), 83-95.
28. IEEE P1363 Annex A/Editorial Contribution: Standard Specifications For Public Key Cryptography, available at http://grouper.ieee.org/groups/1363/
29. Y. Ihara: Hecke polynomials as congruence £ functions in elliptic modular case, Ann. Math. 85(1967), 267-295.
30. Y. Ihara: On Fermat quotients and "the differential of numbers", in: Algebraic analysis and number theory Koukyuuroku vol. 810 (1992), 324-341, RIMS, Kyoto Univ: Kyoto, (in Japanese).
31. N. Katz: An overview of Deligne's proof of the Riemann hypothesis for varieties over finite fields, Proc. Symp. Pure Math. 28(1976) 275-305.
32. D.E. Knuth: The art of computer programming. Vol. 2 Seminumerical algorithms, 2nd ed. Addison wesley:Reading, Mass., 1981.
33. N. Koblitz: Elliptic curve cryptosystems, Math. Comp.48,(1987) 203-209
34. N. Koblitz: CM-curves with good cryptographic properties, in Advances in cryptology-CRYPTO '91 (Santa Barbara, CA, 1991), 279-287, Lecture Notes in Comput. Sci., vol. 576 (1992) Springer-Verlag: Berlin.
35. N. Koblitz: A course in number theory and cryptography(Second edition). Graduate Texts in Mathematics, vol. H4(1994). Springer-Verlag: Berlin.
36. N. Koblitz: Algebraic aspects of cryptography. Algorithms and Compuation in Math. vol.3(1998)
37. H. Kornblum: Uber die Primfunktionen in einer arithmetischen Progression. Math. Z., 5(1919) 100-111
38. M. Kraitchik: Theorie des nombres, vol.1 Gauthier-Villars: Paris, 1922
39. S. Lang: Elliptic functions (2nd ed.), GTM vol. H2 (1987), Springer-Verlag:Berlin
40. A. M. Lerch: Zur Theorie des Fermatschen Quotienten (Formula Presented), Math. Ann., 60(1905), 471-490.
41. J.H. van Lint, G. van der Geer: Introduction to coding theory and algebraic geometry, DMV seminar vol. l2(1988), Birkhauser: Basel.
42. G.-J. Lay, H. G. Zimmer: Constructing elliptic curves with given group order over large finite fields, in Algorithmic number theory (Ithaca, NY, 1994), Lecture Notes in Comput. Sci., 877(1994), 250-263, Springer: Berlin.
43. B. Mazur: Rational points of Abelian varieties with values in towers of number fields, Invent. Math., 18(1972), 183-266.
44. K. S. McCurley: The discrete logarithm problem, in Cryptology and computational number theory, (Boulder, CO, 1989), Proc. Sympos. Appl. Math. vol. 42(1990), 49-74, AMS:Providence, R.I.
45. A. Menezes: Elliptic curve public key cryptosystems. Kluwer academic publ.: Boston, 1993
46. V. S. Miller: Use of elliptic curves in cryptography, in Advances in cryptology-CRYPTO '85 (Santa Barbara, Calif., 1985), Lecture Notes in Comput. Sci. vol. 218(1986), 417-426, Springer: Berlin.
47. F. Morain: Building cyclic elliptic curves modulo large primes, in Advances in cryptology-EUROCRYPT '91 (Brighton, 1991), 328-336, Lecture Notes in Comput. Sci., vol. 547(1991), Springer: Berlin.
48. F. Morain: Calcul du nombre de points sur une curbe elliptique dans un corps fini: aspects algorithmieques, J. Theorie des Nombres de Bordeaux, 7(1995), 255-282.
49. A.J. Menezes, T. Okamoto and S.A. Vanstone: Reducing elliptic curve logarithms to logarithms in a finite field, The 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, May 1991, and also IEEE Trans. Info. Theory, IT-39(1993), 1639-1646.
50. A. Menezes, S. Vanstone: The implementation of elliptic curve cryptosystems, Proc. of AUSCRYPT 90, Lect. Notes in Comput. Science, vol.453(1990), 2-13, Springer: Berlin.
51. A. Menezes, Y. Wu, R. Zucchertato: Hyperelliptic curves, appendix to Koblitz: Algebraic aspects of cryptography, Springer: Berlin.
52. National Institute for Standards and Technology: Specifications for a digital signature standard. Federal information processing standard publication 186(1991).
53. National Institute for Standards and Technology: The digital signature standard, Comm. of the ACM, 35(1992), No.7, pp. 36-40.
54. A.M. Odlyzko: Discrete logarithm and their cryptographic significance, in Advances in cryptology - EUROCRYPT '84, Lect. Notes in Comput. Sci. vol.209(1985), pp. 224-314
55. A.M. Odlyzko: Discrete logarithms and smooth polynomials, in Finite fields: Theory, applications, and algorithms, Contemp. Math. vol.168(1994), 269-278.
56. T. Okamoto, S. Uchiyama: A new public-key cryptosystem as secure as factoring, to appear in EUROCRYPT'98.
57. T. Okamoto, S. Uchiyama: Security of an identity-based cryptosystem and the related reductions, to appear in EUROCRYPT'98.
58. S.C. Pohlig and M.E. Hellman: An improved algorithm for computing logarithm over GF(p) and its cryptographic significance, IEEE Trans. Info. Theory, IT-24(1978), 106-110.
59. J. Pollard: Monte Carlo methods for index compuation ((mod p)), Math. Comp., 32(1978), 918-924.
60. H. G. Ruck: On the Discrete Logarithm in the Divisor Class Group of Curves, preprint, (1997).
61. T. Satoh, K. Araki: Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves, (1997), preprint, to appear in Commentarii Math. Univ. St. Pauli. [Japanese exposition in: Proc. of algebraic number theory and its related topics, Koukyuuroku vol.l026(1998),.pp. 139-150, RIMS Kyoto Univ.:Kyoto.]
62. R. Schoof: Elliptic curves over finite fields and the computation of square roots (mod p), Math. Comp., 44(1985), 483-494.
63. R. Schoof: Nonsingular plane cubic curves over finite fields, J. Comb. Theory, A46(1987), 183-211.
64. C. P. Schnorr: Efficient signature generation by smart cards, J. Cryptology, 4(1991), 161-174.
65. I. A. Semaev: On computing logarithms on elliptic curves. (Russian) Diskret. Mat. 8(1996) 65-71. English translation in Discrete Math. Appl. 6(1996), 69-76.
66. I. A. Semaev: Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curves in characteristic p, Math. Comp., 67(1998), 353-356.
67. J.-P. Serre: Sur la topologie des varietes algebriques en caracteristique p. Symposium international de topologi'a algbraica, 1958, 24-53, Universidad National Aut6noma de Mexico and UNESCO: Mexico City
68. J.-P. Serre: A course in arithmetic, GTM vol.7(1973), Springer: Berlin.
69. D. Shanks: Class number, a theory of factorization, and genera, in 1969 Number Theory Institute, Proc. Symp. Pure. Math. vol. 20 (1971), 415-440 AMS: Providence, R.I.
70. J. H. Silverman: The arithmetic of elliptic curves, GTM vol. l06 (1986), Springer-Verlag:Berlin. (2nd printing: 1992)
71. J. H. Silverman: The advanced arithmetic of elliptic curves, GTM vol.151 (1994), Springer-Verlag.-Berlin
72. N. P. Smart: The discrete logarithm problem on elliptic curves of trace one, (1997), preprint, to appear in J. Cryptology
73. A. D. Thomas: Zeta-functions: an introduction to algebraic geometry. Research notes in Math. Vol. 12 (1977), Pitman: London
74. W.C. Waterhouse: Abelian varieties over finite fields, Ann. sci. Ec. Norm. Sup., 4"serie, 2(1969), 521-586.
75. A. Weil: (a) Sur les courbes algebriques et les varietes qui s'en deduisent, (b) Varices abeliennes et courbes algebriques, Actualites Sci. Ind., Hermann:Paris 1948. [The collected second edition of (a) and (b): Courbes algebriques et varietes abeliennes, 1971.]
76. A. Weil: Numbers of solutions of equations in finite fields, Bull. Amer. Math. Soc. 55(1949), 497-508.