47

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

74

On a problem of Oppenheim concerning Factorisatio Numerorum
–
 1983

1121

PublicKey Cryptosystem and a Signature Scheme Based on Discrete Logarithms
–
 1985

54

The quadratic sieve factoring algorithm
–
 1985

22

On integers free of large prime factors
–
 1986

32

On the number of positives integers ≤ x and free of prime factors
–
 1966

186

Speeding the Pollard and elliptic curve methods of factorization
–
 1987

9

Approximating the number of integers free of large prime factors
–
 1997

8

Numerical solution of some classical differentialdifference equations
–
 1989

917

A Course in Computational Algebraic Number Theory. SpringerVerlag Graduate Texts in Mathematics
–
 1993

2928

A Method for Obtaining Digital Signatures and PublicKey Cryptosystems
–
 1978

2477

Handbook of Applied Cryptography
–
 1997

72

Theorems on factorization and primality testing
–

233

Factoring integers with elliptic curves
–
 1987

72

The multiple polynomial quadratic sieve
–
 1987

43

Factoring with two large primes
–
 1991

18

Computational Aspects of Discrete Logarithms
–
 1996

48

A Monte Carlo method for factorization
–
 1975

27

with small prime factors, and the least kth power nonresidue
–
 1971
