Elliptic curve cryptosystems

We discuss analogs based on elliptic curves over finite fields of public key cryptosystems which use the multiplicative group of a finite field. These elliptic curve cryptosystems may be more secure, because the analog of the discrete logarithm problem on elliptic curves is likely to be harder than the classical discrete logarithm problem, especially over GF(2'). We discuss the question of primitive points on an elliptic curve modulo p, and give a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  H. Hasse.  Beweis des Analogons der Riemannschen Vermutung für die Artinschen und F. K. Schmidtschen Kongruenzzetafunktionen in gewissen elliptischen Fällen. Vorläufie Mitteilung , 1933 .

[3]  D. Shanks.  Solved and Unsolved Problems in Number Theory , 1964 .

[4]  F. E. J. Linton,et al.  The collected papers of Emil Artin , 1966 .

[5]  C. Hooley.  On Artin's conjecture. , 1967 .

[6]  F. J. Budden,et al.  An introduction to algebraic structures , 1976 .

[7]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[8]  S. Lang,et al.  Elliptic Curves: Diophantine Analysis , 1978 .

[9]  Andrew M. Odlyzko,et al.  Discrete Logarithms in Finite Fields and Their Cryptographic Significance , 1985, EUROCRYPT.

[10]  Taher El Gamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, IEEE Trans. Inf. Theory.

[11]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[12]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[13]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[14]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[15]  M. V. Ramana Murty,et al.  Primitive points on elliptic curves , 1986 .

[16]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[17]  N. Koblitz.  A Course in Number Theory and Cryptography , 1987 .

[18]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[19]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..