Computer Packages - Elliptic Curves: Number Theory and Cryptography - page 505

[125] S. Wagstaff. Cryptanalysis of number theoretic ciphers . Computational
Mathematics Series. Chapman and Hall/CRC, Boca Raton, 2003.

[126] D. Q. Wan. On the Lang-Trotter conjecture. J. Number Theory ,

35(3):247-268, 1990.

[127] X. Wang, Y. Yin, Yiqun, and H. Yu. Finding collisions in the full SHA-
1. Advances in cryptology—CRYPTO 2005 , volume 3621 of Lecture
Notes in Comput. Sci. , pages 17-36, Springer, Berlin, 2005.

[128] L. Washington. Wiles' strategy. In Cuatrocientos anos de matematicas
en torno al Ultimo Teorema de Fermat (ed. by C. Corrales Rodriganez
and C. Andradas) , pages 117-136. Editorial Complutense, Madrid,
1999. Section 13.4 of the present topic is a reworking of much of this
article.

[129] L. C. Washington. Introduction to cyclotomic fields , volume 83 of Grad-
uate Texts in Mathematics, (2nd ed.) . Springer-Verlag, New York, 1997.

Ecole

[130] W. C. Waterhouse. Abelian varieties over finite fields. Ann. Sci.

Norm. Sup. (4) , 2:521-560, 1969.

[131] A. Weil Courbes algebriques et varietes abeliennes. 2e ed. .Hermann&
Cie., Paris, 1971.

[132] E. Weiss. Cohomology of groups . Pure and Applied Mathematics, Vol.
34. Academic Press, New York, 1969.

[133] A. Wiles. Modular elliptic curves and Fermat's last theorem. Ann. of
Math. (2) , 141(3):443-551, 1995.

[134] H. C. Williams. A p +1 method of factoring. Math. Comp. , 39(159):225-
234, 1982.