233

Factoring integers with elliptic curves
– H W Lenstra
 1987

50

An improved Monte Carlo factorization algorithm
– R P Brent
 1980

47

Some integer factorization algorithms using elliptic curves
– Richard P. Brent
 1986

21

Parallel implementation of the quadratic sieve
– T R Caron, R D Silverman

19

Factorization of the eleventh Fermat number (preliminary report
– R P Brent
 1989

75

The multiple polynomial quadratic sieve
– R Silverman
 1987

52

Factoring by electronic mail
– Arjen K. Lenstra, Mark S. Manasse
 1990

126

editors. The Development of the Number Field Sieve
– A K Lenstra, H W Lenstra
 1993

50

The factorization of the ninth Fermat number
– A K Lenstra, H W Lenstra Jr, M S Manasse, J M Pollard
 1993

12

Vector and parallel algorithms for integer factorisation
– Richard P. Brent
 1990

72

Theorems of factorization and primality testing
– J Pollard
 1974

30

A pipeline architecture for factoring large integers with the quadratic sieve algorithm,” to appear in a special issue on cryptography of the SIAM
– C Pomerance, J W Smith, R Tuler
 1979

14

A method for obtaining digital dignatures and publickey cryptosystems
– R L Rivest, A Shamir, L Adleman
 1978

42

an Introduction to Computer security,‖ Upper Saddle River NJ
– P Josef, S Jennifer, ―Cryptography
 1989

13

An Implementation of the Number Field Sieve
– Marije ElkenbrachtHuizing
 1996

2453

Handbook of Applied Cryptography
– Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest
 1997

43

Factoring with two large primes
– A K Lenstra, M S Manasse
 1991

52

A block Lanczos Algorithm for finding dependencies over GF(2
– P L Montgomery
 1995

11

te Riele, Factoring integers with large prime variations of the quadratic sieve
– H Boender, H J J
 1996
