Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
- 1 February 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 6 (1), 124-138
- https://doi.org/10.1137/0406010
Abstract
Recently, several algorithms using number eld sieves have been given to factor a number n in heuristic expected time Ln(1=3; c), whereKeywords
This publication has 16 references indexed in Scilit:
- Modifications to the Number Field SieveJournal of Cryptology, 1993
- Factoring integers with the number field sieveLecture Notes in Mathematics, 1993
- Computation of discrete logarithms in prime fieldsDesigns, Codes and Cryptography, 1991
- On wiedemann's method of solving sparse linear systemsLecture Notes in Computer Science, 1991
- Discrete logarithms inGF(p)Algorithmica, 1986
- On Lovász' lattice reduction and the nearest lattice point problemPublished by Springer Science and Business Media LLC ,1984
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- On an Irreducibility Theorem of A. CohnCanadian Journal of Mathematics, 1981
- Transcendental Number TheoryPublished by Cambridge University Press (CUP) ,1975