Weakness of F 3 6·509 for discrete logarithm cryptography, Cryptology ePrint Archive Report, vol.2013446446, 2013. ,
A subexponential algorithm for the discrete logarithm problem with applications to cryptography, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.55-60, 1979. ,
DOI : 10.1109/SFCS.1979.2
The function field sieve, Lecture Notes in Comput. Sci, vol.877, pp.108-121, 1994. ,
DOI : 10.1007/3-540-58691-1_48
Computing Logarithms in Finite Fields of Characteristic Two, SIAM Journal on Algebraic Discrete Methods, vol.5, issue.2, pp.276-285, 1984. ,
DOI : 10.1137/0605029
Abstract, LMS Journal of Computation and Mathematics, vol.32, issue.A, 2013. ,
DOI : 10.1109/TIT.1984.1056941
URL : https://hal.archives-ouvertes.fr/hal-00760424
Fast evaluation of logarithms in fields of characteristic two, IEEE Transactions on Information Theory, vol.30, issue.4, pp.587-594, 1984. ,
DOI : 10.1109/TIT.1984.1056941
New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976. ,
DOI : 10.1109/TIT.1976.1055638
On the Function Field Sieve and the Impact of Higher Splitting Probabilities, Advances in Cryptology ? CRYPTO 2013, pp.109-128, 2013. ,
DOI : 10.1007/978-3-642-40084-1_7
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve, SIAM Journal on Discrete Mathematics, vol.6, issue.1, pp.124-138, 1993. ,
DOI : 10.1137/0406010
Discrete logarithm in GF, p.1778, 2013. ,
Discrete logarithm in GF, p.4080, 2013. ,
Discrete logarithm in GF, p.6168, 2013. ,
Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields, Advances in Cryptology ? EUROCRYPT 2013, pp.177-193, 2013. ,
DOI : 10.1007/978-3-642-38348-9_11
A new index calculus algorithm with complexity L(1/4 + o(1)) in very small characteristic, Cryptology ePrint Archive, p.95, 2013. ,
The Function Field Sieve in the Medium Prime Case, Advances in Cryptology ? EUROCRYPT 2006, pp.254-270, 2006. ,
DOI : 10.1007/11761679_16
URL : https://hal.archives-ouvertes.fr/hal-00456191
The Number Field Sieve in the Medium Prime Case, Advances in Cryptology ? CRYPTO 2006, pp.326-344, 2006. ,
DOI : 10.1007/11818175_19
URL : https://hal.archives-ouvertes.fr/hal-01102034
An analytic approach to smooth polynomials over finite fields, Algorithmic number theory ? ANTS III, pp.226-236, 1998. ,
DOI : 10.1007/BFb0054865
An improved algorithm for computing logarithms over GF (p) and its cryptographic signifiance, IEEE Transactions on Information Theory, vol.241, pp.106-110, 1978. ,
Combinatorial designs, ACM SIGACT News, vol.39, issue.4, 2003. ,
DOI : 10.1145/1466390.1466393