|
41
|
On the frequency of numbers containing prime factors of a certain relative magnitude
– K Dickman
- 1930
|
|
59
|
On a problem of Oppenheim concerning “Factorisatio Numerorum
– E R Canfield, P Erdős, C Pomerance
- 1983
|
|
69
|
The multiple polynomial quadratic sieve
– R D Silverman
- 1987
|
|
49
|
The quadratic sieve factoring algorithm
– C Pomerance
- 1985
|
|
22
|
On integers free of large prime factors
– A Hildebrand, G Tenenbaum
- 1986
|
|
41
|
Factoring With Two Large Primes
– A K Lenstra, M S Manasse
- 1994
|
|
24
|
On the number of positive integers ≤ x and free of prime factors > y
– N G de Bruijn
- 1951
|
|
149
|
Speeding the Pollard and elliptic curve methods of factorization
– P L Montgomery
- 1987
|
|
8
|
Approximating the number of integers free of large prime factors
– Simon Hunter, Jonathan Sorenson
- 1997
|
|
7
|
Numerical solution of some classical differential-difference equations
– G Marsaglia, A Zaman, J C W Marsaglia
- 1989
|
|
961
|
A public key cryptosystem and a signature scheme based on discrete logarithms
– T ElGamal
- 1985
|
|
2057
|
Handbook of Applied Cryptography
– Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest
- 1997
|
|
61
|
Theorems of factorization and primality testing
– John M Pollard
- 1974
|
|
199
|
Factoring integers with elliptic curves
– H W Lenstra
- 1987
|
|
18
|
Computational Aspects of Discrete Logarithms
– Rob Lambert
- 1996
|
|
47
|
Analysis and comparison of some integer factoring algorithms
– C Pomerance
- 1982
|
|
36
|
A Monte Carlo method for factorization
– J M Pollard
- 1975
|
|
36
|
Binary quadratic forms. Classical theory and modern computations
– D Buell
- 1989
|
|
18
|
Numbers with small prime factors and the least kth-power +zon-residue
– K Norton
- 1971
|
