Public-Key Cryptography (1991)

Cached

Download Links

by James Nechvatal
Citations:7 - 0 self

Active Bibliography

Chapter 1—Foundations 1.1 Terminology – Bruce Schneier, Wiley Computer Publishing, John Wiley, Whitfield Diffie
unknown title – Foreword Whitfield Diffie
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
87 Discrete Logarithms in Finite Fields and Their Cryptographic Significance – A. M. Odlyzko - 1984
1 Cryptology – Prof Ronald Rivest, L. Rivest
50 The rise and fall of knapsack cryptosystems – A. M. Odlyzko - 1990
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
1 Discrete Logarithms in Finite Fields – Dean Phillip Reiff, Sylvia Lu, Stan Payne, Dean Phillip (m. S, William Cherowitzo, William Cherowitzo - 1996
5 Diffie-hellman key exchange protocol and non-abelian nilpotent groups. Cryptology ePrint Archive, Report 2005/110 – Ayan Mahalanobis, Miller Group - 2005
26 Open Problems in Number Theoretic Complexity, II – Leonard M. Adleman, Kevin S. Mccurley
36 Lattice Reduction in Cryptology: An Update – Phong Q. Nguyen, Jacques Stern - 2000
69 The Two Faces of Lattices in Cryptology – Phong Q. Nguyen, Jacques Stern - 2001
Easy numbers for the Elliptic Curve Primality Proving Algorithm – F. Morain - 1992
40 Algorithms in algebraic number theory – H. W. Lenstra - 1992
A New World Record for the Special Number Field Sieve Factoring Method – Peter Montgomery, Stefania Cavallar, Herman Te Riele - 1997
Computational Number Theory at CWI in 1970-1994 – H.J.J. te Riele, J. Van De Lune - 1994
2 Atkin's test: news from the front – Franqois Morain, Dipartement De Mathkmatiques, Universitk Claude Bernard - 1990
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
2 DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3 – François Morain - 1991