Author:
Joux Antoine,Lercier Reynald
Reference31 articles.
1. Adleman LM (1979) A subexponential algorithm for the discrete logarithm with applications to cryptography. In: Proceedings of the 20th annual symposium on foundations of computer science, Washington, pp 29–31
2. Adleman LM, Demarrais J (1993) A subexponential algorithm for discrete logarithms over all finite fields. Math Comput 61(203):1–15
3. Adleman LM, Huang MDA (1999) Function field sieve method for discrete logarithms over finite fields. Inform Comput 151(1–2):5–16
4. Bahr F, Franke J, Kleinjung T (2007) Discrete logarithms in GF(p) — 160 digits. Email, Feb 2007
5. Bender RL, Pomerance C (1998) Rigorous discrete logarithm computations in finite fields via smooth polynomials. In: Buell DA, Teitelbaum JT (eds) Studies in advanced mathematics, vol 7. American Mathematical Society and International Press, Providence