The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem

Designs, Codes, and Cryptography

Volumn 20, Issue 1, 2000, Pages 5-40

  Silverman, Joseph H ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Discrete logarithm; Elliptic curve; Xedni calculus

Indexed keywords

EID: 0012234171     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008319518035     Document Type: Article

References (24)

1. B. Birch and H. P. F. Swinnerton-Dyer, Elliptic curves and modular functions, Modular Functions of One Variable, Antwerp IV: Springer Lecture Notes 476 (Birch and Kuyk, eds.), Springer-Verlag (1975) pp. 2-32.
2. H. Cohen, A Course in Computational Number Theory, GTM 138, Springer-Verlag (1993).
3. I. Connell, Addendum to a paper of Harada and Lang, J. Algebra, Vol. 145 (1992) pp. 463-467.
4. J. Cremona, Algorithms for Modular Elliptic Curves, (2nd ed.) Cambridge University Press (1997).
5. E. Fouvry, M. Nair, and G. Tenenbaum, L'ensemble exceptionnel dans la conjecture de Szpiro, Bull. Soc. Math. France, Vol. 120 (1992) pp. 485-506.
6. G. Havas, B. S. Majewski, and K. R. Matthews, Extended gcd and Hermite normal form algorithms via lattice basis reduction, Experimental Math., Vol. 7 (1998) pp. 125-136
7. M. Hindry and J. H. Silverman, The canonical height and integral points on elliptic curves, Invent. Math., Vol. 93, pp. 419-450 (1988).
8. M. J. Jacobson, N. Koblitz, J. H. Silverman, A. Stein, and E. Teske, Analysis of the Xedni Calculus Attack, Designs, Codes and Cryptography, Vol. 20 (2000), pp. 41-64.
9. N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, Vol. 48, pp. 203-209 (1987).
10. N. Koblitz, Private communications, September 1998.
11. H. Lenstra, Factoring integers with elliptic curves, Annals of Math, Vol. 126 (1987) pp. 649-673.
12. D. W. Masser, Specializations of finitely generated subgroups of abelian varieties, Trans. AMS, Vol. 311 (1989) pp. 413-424.
13. K. Matthews, Short solutions of AX = B using a LLL-based Hermite normal form algorithm, August 18, 1998, preprint.
14. J. F. Mestre, Formules explicites et minoration de conducteurs de variétés algébriques, Compositio Math., Vol. 58 (1986) pp. 209-232.
15. V. S. Miller, Use of elliptic curves in cryptography, Advances in Cryptology CRYPTO '85: Lecture Notes in Computer Science, vol. 218 Springer-Verlag (1986) pp. 417-426.
16. A. Néron, Propriétés arithmétiques et géométriques rattachés à la notion de rang d'une courbe algébrique dans un corps, Bull. Soc. Math. France, Vol. 80 (1952) pp. 101-166.
17. D. Rohrlich, Variation of the root number in families of elliptic curves, Compositio Math, Vol. 87 (1993) pp. 119-151
18. 3(E), unpublished.
19. J. H. Silverman, The Arithmetic of Elliptic Curves, Graduate Texts in Math., Vol. 106, Springer-Verlag, Berlin and New York (1986).
20. J. H. Silverman, Computing heights on elliptic curves, Math. Comp., Vol. 51 (1988) pp. 339-358.
21. J. H. Silverman, Computing canonical heights with little (or no) factorization, Math. Comp., Vol. 66 (1997) pp. 787-805.
22. J. H. Silverman and J. Suzuki, Elliptic curve discrete logarithms and the index calculus, ASIACRYPT '98: Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1998, pp. 110-125.
23. J. H. Silverman and J. Tate, Rational points on elliptic curves, Springer-Verlag, New York (1992).
24. A. Wiles, Modular elliptic curves and Fermat's last theorem, Annals of Math, Vol. 141 (1995) pp. 443-551