Discrete logarithms in gf(p) using the number field sieve (1993)

by Daniel M. Gordon
Venue:SIAM J. Discrete Math
Citations:63 - 1 self

Active Bibliography

21 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Algorithmic Number Theory MSRI Publications – Oliver Schirokauer
16 Designing and detecting trapdoors for discrete log cryptosystems – Daniel M. Gordon - 1993
17 Lecture Notes on Cryptography – Shafi Goldwasser, Mihir Bellare - 2001
24 Discrete Logarithms: the Effectiveness of the Index Calculus Method – Oliver Schirokauer, Damian Weber, Thomas Denny - 1996
Divisibility, Smoothness and Cryptographic Applications – David Naccache, Igor E. Shparlinski - 2008
14 Improvements to the general number field sieve for discrete logarithms in prime fields – Antoine Joux, Reynald Lercier - 2003
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
20 Recent progress and prospects for integer factorisation algorithms – Richard P. Brent - 2000
41 Parallel Algorithms for Integer Factorisation – Richard P. Brent
9 Fast Computation Of The Smith Form Of A Sparse Integer Matrix – Mark Giesbrecht - 1996
26 The Diffie-Hellman Protocol – Ueli M. Maurer, Stefan Wolf - 1999
10 Comments on search procedures for primitive roots – Eric Bach - 1997
15 Discrete Logarithms and Smooth Polynomials – Andrew M. Odlyzko - 1993
26 Open Problems in Number Theoretic Complexity, II – Leonard M. Adleman, Kevin S. Mccurley
8 Answers To Frequently Asked Questions About Today's Cryptography – Paul Fahn - 1993
10 On arithmetic and the discrete logarithm problem in class groups of curves – Claus Diem - 2008
1 Discrete Logarithms in Finite Fields – Dean Phillip Reiff, Sylvia Lu, Stan Payne, Dean Phillip (m. S, William Cherowitzo, William Cherowitzo - 1996
6 Are `Strong' Primes Needed for RSA? – Ronald L. Rivest, Robert D. Silverman - 1999