B. Allombert, Explicit Computation of Isomorphisms between Finite Fields. Finite Fields and Their Applications, vol.8, pp.332-342, 2002.

W. Bosma, J. Cannon, and C. Playoust, The MAGMA algebra system I: the user language, Journal of Symbolic Computation, vol.24, pp.235-265, 1997.

W. Bosma, J. Cannon, and A. Steel, Lattices of compatibly embedded finite fields, Journal of Symbolic Computation, vol.24, pp.351-369, 1997.

A. Bostan, P. Flajolet, B. Salvy, and É. Schost, Fast computation of special resultants, Journal of Symbolic Computation, vol.41, issue.1, pp.1-29, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000960

A. Bostan, G. Lecerf, and É. Schost, Tellegen's principle into practice, ISSAC'03. ACM, pp.37-44, 2003.

P. Richard, H. Brent, and . Kung, Fast Algorithms for Manipulating Formal Power Series, J. ACM, vol.25, pp.581-595, 1978.

L. Brieulle, J. Luca-de-feo, J. Doliskani, É. Flori, and . Schost, Computing isomorphisms and embeddings of finite fields (extended version), 2017.

L. Brieulle, J. Luca-de-feo, J. Doliskani, É. Flori, and . Schost, Computing isomorphisms and embeddings of finite fields, Math. Comp, vol.88, pp.1391-1426, 2019.

P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, 1997.

J. Couveignes and R. Lercier, Fast construction of irreducible polynomials over finite fields, Israel Journal of Mathematics, vol.194, pp.77-105, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00456456

J. Luca-de-feo, É. Doliskani, and . Schost, Fast algorithms for ?-adic towers over finite fields, ISSAC'13. ACM, pp.165-172, 2013.

J. Luca-de-feo, É. Doliskani, and . Schost, Fast Arithmetic for the Algebraic Closure of Finite Fields, ISSAC '14. ACM, pp.122-129, 2014.

É. Luca-de-feo and . Schost, Fast arithmetics in Artin-Schreier towers over finite fields, Journal of Symbolic Computation, vol.47, pp.771-792, 2012.

J. Doliskani and É. Schost, Computing in degree 2 k -extensions of finite fields of odd characteristic, Designs, Codes and Cryptography, vol.74, pp.559-569, 2015.

C. Fieker, W. Hart, T. Hofmann, and F. Johansson, Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language, ISSAC '17. ACM, pp.157-164, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01524140

W. Hart, F. Johansson, and S. Pancratz, Fast Library for Number Theory, 2013.

S. Lenwood, N. A. Heath, and . Loehr, New algorithms for generating Conway polynomials over finite fields, SODA '99. SIAM, pp.429-437, 1999.

S. Kiran, C. Kedlaya, and . Umans, Fast Polynomial Factorization and Modular Composition, SIAM J. Comput, vol.40, pp.1767-1802, 2011.

H. W. Lenstra, Finding isomorphisms between finite fields, Math. Comp, vol.56, pp.329-347, 1991.
DOI : 10.1090/s0025-5718-1991-1052099-2
URL : https://openaccess.leidenuniv.nl/bitstream/handle/1887/2144/346_100.pdf?sequence=1

H. W. Lenstra and . Bart-de-smit, Standard models for finite fields, Handbook of Finite Fields, pp.401-404, 2013.

A. Kumar-narayanan, Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves, WAIFI 2018, vol.11321, 2018.

W. Nickel, Endliche Körper in dem gruppentheoretischen Programmsystem GAP, 1988.

D. Roe, J. Flori, and P. Bruin, Implement pseudo-Conway polynomials, Trac ticket #14958, 2013.

V. Shoup, Fast construction of irreducible polynomials over finite fields, Journal of Symbolic Computation, vol.17, pp.371-391, 1994.

V. Shoup, Efficient computation of minimal polynomials in algebraic extensions of finite fields, ISSAC'99. ACM, pp.53-58, 1999.

G. The and . Group, GAP -Groups, Algorithms, and Programming, Version 4.9.2. The GAP Group, 2018.

, The Sage Developers 2019. SageMath, the Sage Mathematics Software System (Version 8.7

J. Von-zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.