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
Discrete logarithms and factoring, 1984. ,
Factoring integers with the number field sieve, Lecture Notes in Mathematics, vol.32, issue.107, pp.50-94, 1993. ,
DOI : 10.1109/TIT.1986.1057137
On a problem of Oppenheim concerning ???factorisatio numerorum???, Journal of Number Theory, vol.17, issue.1, pp.1-28, 1983. ,
DOI : 10.1016/0022-314X(83)90002-1
Heuristics on class groups of number fields. Number Theory Noordwijkerhout, pp.33-62, 1983. ,
A Course in Computational Algebraic Number Theory, 1993. ,
Modifications to the number field sieve, J. of Cryptology, vol.6, pp.169-180, 1993. ,
Fast evaluation of logarithms in fields of characteristic two. Information Theory, IEEE Transactions on, vol.30, issue.4, pp.587-594, 2002. ,
Discrete logarithms inGF(p), Algorithmica, vol.13, issue.1-4, pp.1-15, 1986. ,
DOI : 10.1007/BF01840433
An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve, Public Key Cryptography, pp.174-190, 2006. ,
DOI : 10.1007/11745853_12
On the asymptotic complexity of matrix multiplication, SFCS'81. 22nd Annual Symposium on, pp.82-90, 1981. ,
New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976. ,
DOI : 10.1109/TIT.1976.1055638
Discrete logarithms in gf (p) using the number field sieve, SIAM Journal of Discrete Mathematics, vol.6, pp.124-138, 1993. ,
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, Mathematics of Computation, vol.72, issue.242, pp.953-967, 2003. ,
DOI : 10.1090/S0025-5718-02-01482-5
URL : https://hal.archives-ouvertes.fr/hal-01102016
Factoring Integers with Elliptic Curves, The Annals of Mathematics, vol.126, issue.3, pp.649-673, 1987. ,
DOI : 10.2307/1971363
An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.1, pp.106-110, 1978. ,
DOI : 10.1109/TIT.1978.1055817
Algebraic and combinatoric aspects of cryptography, 1977. ,
The lattice sieve. The development of the number field sieve, pp.43-49, 1993. ,
Analysis and comparison of some integer factoring algorithms, Mathematisch Centrum Computational Methods in Number Theory, 1982. ,
A tale of two sieves. Biscuits of Number Theory, p.85, 2008. ,
Virtual logarithms, Journal of Algorithms, vol.57, issue.2, pp.140-147, 2005. ,
DOI : 10.1016/j.jalgor.2004.11.004
Searching for primitive roots in finite fields, Proceedings of the twenty-second annual ACM symposium on Theory of computing, pp.546-554, 1990. ,
A computational introduction to number theory and algebra, 2009. ,
The multiple polynomial quadratic sieve, Mathematics of Computation, vol.48, issue.177, pp.329-339, 1987. ,
The Gauss Class-Number Problems Analytic number theory: a tribute to Gauss and Dirichlet, p.247, 2007. ,
Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986. ,
DOI : 10.1109/TIT.1986.1057137