44

On the frequency of numbers containing prime factors of a certain relative magnitude
– K Dickman
 1930

74

On a problem of Oppenheim concerning “factorisatio numerorum
– E R Canfield, Paul Erdős, Carl Pomerance
 1983

1109

A public key cryptosystem and a signature scheme based on discrete logarithms
– T ElGamal
 1985

56

The Quadratic Sieve Factoring Algorithm
– Carl Pomerance
 1984

26

On integers free of large prime factors
– A Hildebrand, G Tenenbaum
 1986

31

On the number of positive integers ≤ x and free of prime factors ≥ y
– N G de Bruijn
 1966

187

Speeding the Pollard and Elliptic Curve Methods of Factorization
– P L Montgomery
 1987

9

Approximating the number of integers free of large prime factors
– Simon Hunter, Jonathan Sorenson
 1997

8

Numerical solution of some classical differentialdifference equations
– George Marsaglia, Arif Zaman, John C W Marsaglia
 1989

918

A Course in Computational Algebraic Number Theory, Graduate Texts
– H Cohen
 1993

2895

A Method for Obtaining Digital Signatures and PublicKey Cryptosystems
– R.L. Rivest, A. Shamir, L. Adleman
 1978

2453

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

72

Theorems of factorization and primality testing
– J Pollard
 1974

233

Factoring integers with elliptic curves
– H W Lenstra
 1987

75

The multiple polynomial quadratic sieve
– R Silverman
 1987

43

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

18

Computational Aspects of Discrete Logarithms
– Rob Lambert
 1996

47

A monte carlo method for factorization
– John M Pollard
 1975

27

with small prime factors, and the least kth power nonresidue
– Karl K Numbers Norton
 1971
