2693

New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
 1976

2895

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

72

Solving Large Sparse Linear Systems Over Finite Fields
– B. A. Lamacchia, A. M. Odlyzko
 1991

38

Computation of Discrete Logarithms in Prime Fields
– Lamacchia Odlyzko, B. A. Lamacchia, A. M. Odlyzko
 1991

184

Solving sparse linear equations over finite fields
– D Wiedemann
 1986

43

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

918

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

8

Fast evaluation of discrete logarithms in fields of characteristic two
– D Coppersmith
 1984

301

An improved algorithm for computing logarithms over GF (p) and its cryptographic significance
– G C Pohlig, M E Hellman
 1978

581

Efficient signature generation by smart cards
– C P Schnorr
 1991

1109

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

23

Evaluating logarithms
– D Coppersmith
 1984

202

A subexponential algorithm for the discrete logarithm problem with applications to cryptography
– Leonard Adleman
 1979

179

Solution of systems of linear equations by minimized iterations
– Cornelius Lanczos
 1952

52

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

126

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

53

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

706

Factoring polynomials with rational coefficients
– A. K. Lenstra, H. W. Lenstra
 1982

4

Computing logarithms in fields of characteristic two
– I F Blake, R FujiHara, R C Mullin, S A Vanstone
 1984
