Reducing elliptic curve logarithms to logarithms in a finite field

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 80-89

  Menezes, Alfred ^a   Vanstone, Scott ^a   Okamoto, Tatsuaki ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY;

E-FIELD; ELLIPTIC CURVE; EXPONENTIAL TIME; FINITE FIELDS; MULTIPLICATIVE GROUPS; PROBABILISTIC POLYNOMIAL TIME; SUBEXPONENTIAL TIME; SUPERSINGULAR ELLIPTIC CURVE;

COMPUTATION THEORY;

EID: 85030330304     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103434     Document Type: Conference Paper

References (19)

1. L. Adleman, taking roots K. Manders and G. Miller, "On in tit e fields", Proceedings of the 20th Annual Symposium on the Foundations of Computer Science (1979), 175-178.
2. A. Bender and G. Castagnoli, "On the implementation of elliptic curve cryptosystems", Advances in Cryptology-Proceedings of Crypto 89, Lecture Notes in Computer Science, 435 (1990), Springer-Verlag, 417-426.
3. D. Coppersmith, "Fast evaluation of logarithms in fields of characteristic two", L Transactions on Information Theory, IT-30 (1984), 587-594.
4. D. Coppersmith, A. Odlyzko and R. Schroeppel, "Discrete logarithms in GF(p)", Algorithrnica, 1 (1986), 1-15.
5. T. EIGamal, "A subexponential-Time algorithm for computing discrete logarithms over GF(p2)", IEEE Transactions on Information Theory, IT-31 (1985), 473-481.
6. B. Kaliski, "A pseudorandom bit generator based on elliptic logarithms", Advances in Cryptology-Proceedings of Crypto 86, Lecture Notes in Computer Science, 293 (1987), Springer-Verlag, 84-103.
7. B. Kaliski, Ewptic curves and cryptography: A pseudorandom bit generator and other tools", PhD thesis, M. L T., January 1988.
8. N. Koblitz, "Elliptic curve cryptosystems", Mathematics of Computation, 48 (1987), 203-209.
9. A. Menezes and S. Vanstone, "The implement ation of elliptic curve crypt osyst ems", Advances in Cryptology-Proceedings of Auscrypt 90, Lecture Notes in Computer Science, 453 (1990), Springer-Verlag, 2-13.
10. A. Menezes and S. Vanstone, "Elliptic curve crypt os yst ems and their implementation", in preparation. V. Miller, "Short programs for functions on curves", unpublished manuscript, 1986.
11. V. Miller, "Uses of elliptic curves in cryptography", Advances in Cryptology-Proceedings of Crypto 85, Lecture Notes in Computer Science, 218 (1986), Springer-Verlag, 417-426.
12. A. Odlyzko, "Discrete logarithms and their crypt ographic significance", Advances in Cryptology-Proceedings of Eurocrypt 84, Lecture Notes in Computer Science, 209 (1985), Springer-Verlag, 224-314.
13. C. Pomerance, "Fast, rigorous factorization and discrete logarithms algorithms", Discrete Algorithms and Complexity (1987), 119-143.
14. M. Rabin, "Probabilistic algorithms in finite fields", SIAM Journal on Computing, 9 (1980), 273-280.
15. J. Rosser and L. Schoentleld, "Approximate formulas for some functions of prime numbers", Illinois Journal of Mathematics, 6 (1962), 64-94.
16. R. Schoof, "Elliptic curves over finite fields and the computation of square roots mod p", Mathematics of Computation, 44 (1985), 483-494.
17. R. Schoof, "Nonsingular plane cubic curves over finite fields", Journal of Combinatom.al Theory, A 46 (1987), 183-211.
18. J. Silverman, The Arithmetic of Elliptic Curves, Springer-Verlag, New York, 1986.
19. R. Silverman, "The multiple polynomial quadratic sieve", Mathematics of ComputatiO? t, 48 (1987), 329-339.