Page 449 -

424 Appendix II: Elliptic Curves in Algorithmic Number Theory and Cryptography

References

Cohen, H., A Course in Computational Algebraic Number Theory. Springer-Verlag,
1996.
Blake, I., Seroussi, G., and Smart, N., Elliptic Curves in Cryptography. LMS Lecture
Notes Series 265, Cambridge University Press, 1999.
Lenstra, H. W., Factoring integers with elliptic curves. Ann. Math. 126, 649–673,
1987.
Solovay, R. and Strassen, V., A fast Monte Carlo test for primality. SIAM J. Comp.
6, 84–85, 1977. Erratum Vol. 7, 118, 1978.
Goldwasser, S. and Kilian, J., Almost all primes can be quickly certified. 18th STOC,
316–329, 1986.
Atkin, A. O. L. and Morain, F., Elliptic curves and primality proving. Math. Comp.
61, 29–67, 1993.
Schoof, R., Elliptic curves over finite fields and the computation of square roots mod
p. Math. Comp. 44, 483–494, 1985.
Schoof, R., Counting points on elliptic curves over finite fields. J. Th´ eorie des Nom-
bres de Bordeaux 7, 219–254, 1995.