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

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

Documents Related by Co-Citation

165 A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, Algorithmic Number Theory – Leonard M Adleman, Jonathan DeMarrais, Ming-Deh Huang - 1994
256 An improved algorithm for computing logarithms over GF (p) and its cryptographic significance – S Pohlig, M Hellman - 1978
961 A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm – T ElGamal - 1985
193 Monte Carlo methods for index computation (mod p – J M Pollard - 1978
2292 New Directions in Cryptography – Whitfield Diffie, Martin E. Hellman - 1976
559 Elliptic curve cryptosystems – N Koblitz - 1987
419 Use of elliptic curves in cryptography – V Miller - 1986
512 Efficient signature generation for smart cards – C P Schnorr - 1991
72 Fast evaluation of logarithms in fields of characteristic two – Don Coppersmith - 1984
243 Reducing elliptic curve logarithms to logarithms in a finite field – A Menezes, T Okamoto, S A Vanstone - 1993
114 Constructive And Destructive Facets Of Weil Descent On Elliptic Curves – P. Gaudry, F. Hess, N. P. Smart - 2000
7 Discrete logarithms: the effectiveness of the index calculus method – F Denny - 1996
108 The development of the number field sieve – A K Lenstra, H W Lenstra - 1993
2057 Handbook of Applied Cryptography – Alfred J. Menezes, Paul C. Van Oorschot, Scott A. Vanstone, R. L. Rivest - 1997
33 Computation of Discrete Logarithms in Prime Fields – Lamacchia Odlyzko, B. A. Lamacchia, A. M. Odlyzko - 1991
2507 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
169 Hans-Georg Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves – Gerhard Frey - 1994
66 N.: The improbability that an elliptic curve has subexponential discrete log problem under the menezes-okamoto-vanstone algorithm – R Balasubramanian, Koblitz - 1998
104 CM-Curves with Good Cryptographic Properties – N Koblitz - 1991