Bibliography
- BCS97
-
Wieb Bosma, John Cannon, and Allan Steel.
Lattices of Compatibly Embedded Finite Fields.
J. Symbolic Comp., 24(3):351--369, 1997.
- Cop84
-
D. Coppersmith.
Fast evaluation of logarithms in fields of characteristic two.
IEEE Trans. Inform. Theory, IT--30(4):587--594, July 1984.
- COS86
-
D. Coppersmith, A. M. Odlyzko, and R. Schroeppel.
Discrete logarithms in GF(p).
Algorithmica, 1:1--15, 1986.
- GM93
-
D. M. Gordon and K. S. McCurley.
Massively parallel computation of discrete logarithms.
In Ernest F. Brickell, editor, Advances in Cryptology---CRYPTO 1992, volume 740 of LNCS, pages 312--323. Springer-Verlag, 1993.
Proc. 12th Annual International Cryptology Conference, Santa Barbara, Ca, USA, August 16--20, 1992.
- LO91a
-
B. A. LaMacchia and A. M. Odlyzko.
Computation of Discrete Logarithms in Prime Fields.
In A.J. Menezes and S. Vanstone, editors, Advances in Cryptology---CRYPTO 1990, volume 537 of INCS, pages 616--618.
Springer-Verlag, 1991.
- LO91b
-
B. A. LaMacchia and A. M. Odlyzko.
Solving Large Sparse Linear Systems over Finite Fields.
In A.J. Menezes and S. Vanstone, editors, Advances in Cryptology---CRYPTO 1990, volume 537 of LNCS, pages 109--133.
Springer-Verlag, 1991.
- PH78
-
S. C. Pohlig and M. E. Hellman.
An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance.
IEEE Trans. Inform. Theory, 24:106--110, 1978.
- Tho01
-
Emmanuel Thomé.
Computation of discrete logarithms in (F)_(2607).
In Colin Boyd and Ed Dawson, editors, Advances in Cryptology---AsiaCrypt 2001, volume 2248 of LNCS, pages 107--124.
Springer-Verlag, 2001.
Proc. 7th International Conference on the Theory and Applications of Cryptology and Information Security, Dec. 9--13, 2001, Gold Coast,
Queensland, Australia.
V2.28, 13 July 2023