---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/BasicRings/FiniteFields/bibliography.html"
source: "https://docs.magma-maths.org/BasicRings/FiniteFields/bibliography.md"
part: "Basic Rings"
chapter: "Finite Fields"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Basic Rings", "source": "../index-basic-rings.md"}
  - {"title": "Finite Fields", "source": "index-finite-fields.md"}
prev: {"title": "Permutation Polynomials", "source": "permutation-polynomials.md"}
next: {"title": "Nearfields", "source": "../Nearfields/index-nearfields.md"}
---

# Bibliography

<a id="cite-adlemanhuang99"></a>
- **[AH99]** L. M. Adleman and M.-D. A. Huang. Function field sieve method for discrete logarithms over finite fields. *Inform. and Comput.*, 151(1–2):5–16, 1999.
<a id="cite-finitefields"></a>
- **[BCS97]** Wieb Bosma, John Cannon, and Allan Steel. Lattices of Compatibly Embedded Finite Fields. *J. Symbolic Comp.*, 24(3):351–369, 1997.
<a id="cite-coppersmith84"></a>
- **[Cop84]** D. Coppersmith. Fast evaluation of logarithms in fields of characteristic two. *IEEE Trans. Inform. Theory*, IT–30(4):587–594, July 1984.
<a id="cite-cos-log"></a>
- **[COS86]** D. Coppersmith, A. M. Odlyzko, and R. Schroeppel. Discrete logarithms in GF($p$). *Algorithmica*, 1:1–15, 1986.
<a id="cite-gomc93"></a>
- **[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, 312–323. Springer-Verlag, 1993. Proc. 12th Annual International Cryptology Conference, Santa Barbara, Ca, USA, August 16–20, 1992.
<a id="cite-jouxlercier06"></a>
- **[JL06]** A. Joux and R. Lercier. The function field sieve in the medium prime case. In *Advances in Cryptology – EUROCRYPT 2006*, volume 4004 of Lecture Notes in Comput. Sci., 254–270. Berlin, 2006. Springer.
<a id="cite-lo-log"></a>
- **[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, 616–618. Springer-Verlag, 1991.
<a id="cite-lo-slinalg"></a>
- **[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, 109–133. Springer-Verlag, 1991.
<a id="cite-pohlighellman"></a>
- **[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.
<a id="cite-thome01"></a>
- **[Tho01]** Emmanuel Thomé. Computation of discrete logarithms in ${\rm\bf F}_{2^{607}}$. In Colin Boyd and Ed Dawson, editors, *Advances in Cryptology—AsiaCrypt 2001*, volume 2248 of LNCS, 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.