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, P Erd os, C Pomerance
 1983

75

The multiple polynomial quadratic sieve
– R Silverman
 1987

56

The Quadratic Sieve Factoring Algorithm
– Carl Pomerance
 1984

24

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

43

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

31

On the Number of Positive Integers < x and Free of Prime Factors > y
– N G de Bruijn
 1950

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

1107

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

2445

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

71

Theorems of factorization and primality testing
– J Pollard
 1974

233

Factoring Integers with Elliptic Curves
– Hendrik W Lenstra
 1987

18

Computational Aspects of Discrete Logarithms
– Rob Lambert
 1996

53

Analysis and comparison of some integer factoring algorithms
– Carl Pomerance
 1982

40

Binary quadratic forms: classical theory and modern computations
– D A BUELL
 1989

47

A monte carlo method for factorization
– J M Pollard
 1975

27

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