Discrete Logarithms in Finite Fields and Their Cryptographic Significance (1984)

by A. M. Odlyzko
Citations:87 - 6 self

Active Bibliography

1 Cryptology – Prof Ronald Rivest, L. Rivest
Cryptographic Primitives – Paul Garrett - 2007
188 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
Computer Science Journal of Moldova, vol.11, no.2(32), 2003 Finite fields and cryptology – Ennio Cortellini
68 Subquadratic-time factoring of polynomials over finite fields – Erich Kaltofen, Victor Shoup - 1998
1 Algebraic algorithms – Angel Diaz, Ioannis Z. Emiris, Erich Kaltofen, Victor Y. Pan
A Cryptosystem Based on the Symmetric Group Sn – Javad N. Doliskani, Ehsan Malekian, Ali Zakerolhosseini
3 Elliptic Curves and their use in Cryptography – Victor S. Miller - 1997
369 Guide to Elliptic Curve Cryptography – Aleksandar Jurisic, Alfred J. Menezes - 2004
17 An overview of computational complexity – Stephen A. Cook - 1983
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm РFran̤ois Morain - 1988
26 Open Problems in Number Theoretic Complexity, II – Leonard M. Adleman, Kevin S. Mccurley
3 Removing Randomness From Computational Number Theory – Victor Shoup - 1989
80 The XTR public key system – Arjen K. Lenstra, Eric R. Verheul - 2000
11 Asymptotically optimal communication for torus-based cryptography – Marten Van Dijk, David Woodruff - 2004
8 Elliptic curve cryptography: The serpentine course of a paradigm shift – Ann Hibner Koblitz, Neal Koblitz, Alfred Menezes - 2008
unknown title – Foreword Whitfield Diffie
Chapter 1—Foundations 1.1 Terminology – Bruce Schneier, Wiley Computer Publishing, John Wiley, Whitfield Diffie