63
Views
5
CrossRef citations to date
0
Altmetric
Miscellany

On the cubic sieve method for computing discrete logarithms over prime fields

&
Pages 1481-1495 | Received 13 Dec 2002, Published online: 31 Aug 2007

References

  • Coppersmith , D. , Odlyzko , A. M. and Schroeppel , R. 1986 . Discrete logarithms in GF(p) . Algorithmica , 1 : 1 – 15 .
  • LaMacchia , B. A. and Odlyzko , A. M. 1991 . Computation of discrete logarithms in prime fields . Designs, Codes, and Cryptography , 1 : 46 – 62 .
  • McCurley , K. S. The discrete logarithm problem. Cryptology and computational number theory . Proceeding of Symposia in Applied Mathematics . Vol. 42, 49–74 ,
  • Menezes , A. J. 1993 . Applications of Finite Fields , Edited by: Menezes , A. J. Dordnecht : Kluwer Academic Publishers .
  • Odlyzko , A. M. Discrete logarithms and their cryptographic significance. Advances in Cryptology: Proceedings of Eurocrypt84 . pp. 224 – 314 . LNCS No. 209
  • Das , A. and Veni Madhavan , C. E. Performance comparison of linear sieve and cubic sieve algorithms for discrete logarithms over prime fields . Proceedings of ISAAC99 . pp. 295 – 306 . LNCS No. 1741
  • Gordon , D. M. 1993 . Discrete logarithms in GF(p) using the number field sieve . SIAM Journal of Discrete Mathematics , 6 : 124 – 138 .
  • Schirokauer , O. , Weber , D. and Denny , T. Discrete logarithms, the effectiveness of the index calculus method . Proceedings of ANTS . pp. 337 – 361 . LNCS no. 1122
  • Weber , D. Computing discrete logarithms with the general number field sieve . Procceedings of ANTS . pp. 99 – 114 . LNCS no. 1122
  • Weber , D. and Denny , T. The solution of McCurleys discrete log challenge . Procceedings of Crypto98 . pp. 458 – 471 . LNCS no. 1462
  • Bressoud , D. M. 1989 . Factorization and Primary Testing , Berlin : Springer-Verlag . Undergraduate Text in Mathematics
  • Gerver , J. 1983 . Factoring large numbers with a quadratic sieve . Mathematics of Computation , 41 : 287 – 294 .
  • Silverman , R. D. 1987 . The multiple polynomial quadratic sieve . Mathematics of Computation , 48 : 329 – 339 .
  • LaMacchia , B. A. and Odlyzko , A. M. 1991 . “ Solving large sparse linear systems over finite fields ” . 109 – 133 . Advances in Cryptology – CRYPTO90, LNCS #537
  • Das , A. and Veni Madhavan , C. E. 1998 . “ Galois field library. Reference manual ” . Indian Institute of Science . Technical Report No IISc-CSA-98-05, Department of Computer Science and Automation
  • Apostol , T. M. 1976 . Introduction to Analytic Number Theory , Berlin : Springer-Verlag . Undergraduate Text in Mathematics
  • Lenstra , A. K. and Lenstra , H. W. 1990 . “ Algorithms in number theory ” . In Handbook of Theoretical Computer Science Edited by: van Leeuwen , J. 675 – 715 .
  • Cohen , H. 1993 . A Course in Computational Algebraic Number Theory , Berlin : Springer-Verlag . Graduate Text in Mathematics No. 138

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.