920

A Course in Computational Algebraic Number Theory, SpringerVerlag, 3rd printing
– H Cohen
 1996

542

A Classical Introduction to Modern Number Theory, Graduate Texts
– K Ireland, M Rosen
 1990

28

Implementing the asymptotically fast version of the elliptic curve primality proving algorithm
– F. Morain, Of P. Berrizbeitia, D. Bernstein, P. Mihăilescu, R. Mocenigo

19

Proving primality in essentially quartic random time
– Daniel J. Bernstein
 2003

133

Prime Numbers: A Computational Perspective
– R Crandall, C Pomerance
 2002

825

The Arithmetic of Elliptic Curves
– J Silverman
 1986

724

A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
– H Chernoff
 1952

688

The Art of Computer Programming, volume 2, Seminumerical Algorithms. Addison{Wesley, third edition
– D Knuth
 2001

2765

New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
 1976
