Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves

  • Anand Kumar NarayananEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11321)


We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality \(q^n\), our algorithm takes
$$n^{1+o(1)} \log ^{1+o(1)}q + \max _{\ell } \left( \ell ^{n_\ell + 1+o(1)} \log ^{2+o(1)} q + O(\ell \log ^5q)\right) $$
time, where \(\ell \) runs through primes dividing n but not \(q(q-1)\) and \(n_\ell \) denotes the highest power of \(\ell \) dividing n. Prior to this work, the best known run time dependence on n was quadratic. Our run time dependence on n is at worst quadratic but is subquadratic if n has no large prime factor. In particular, the n for which our run time is nearly linear in n have natural density at least 3 / 10. The crux of our approach is finding a point on an elliptic curve of a prescribed prime power order or equivalently finding preimages under the Lang map on elliptic curves over finite fields. We formulate this as an open problem whose resolution would solve the finite field isomorphism problem with run time nearly linear in n.


  1. [All02]
    Allombert, B.: Explicit computation of isomorphisms between finite fields. Finite Fields Their Appl. 8, 332–342 (2002)MathSciNetCrossRefGoogle Scholar
  2. [BGJT14]
    Barbulescu, R., Gaudry, P., Joux, A., Thomé, E.: A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 1–16. Springer, Heidelberg (2014). Scholar
  3. [Ben81]
    Ben-Or, M.: Probabilistic algorithms in finite fields. In: FOCS, pp. 394–398 (1981)Google Scholar
  4. [Ber67]
    Berlekamp, E.R.: Factoring polynomials over finite fields. Bell Syst. Tech. J. 46, 1853–1859 (1967)MathSciNetCrossRefGoogle Scholar
  5. [BDDFS17]
    Brieulle, L., De Feo, L., Doliskani, J., Flori, J.-P., Schost, E.: Computing isomorphisms and embeddings of finite fields. To appear in Mathematics of Computation.
  6. [CZ81]
    Cantor, D.G., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comput. 36, 587–592 (1981)MathSciNetCrossRefGoogle Scholar
  7. [CL13]
    Couveignes, J.-M., Lercier, R.: Fast construction of irreducible polynomials over finite fields. Israel J. Math. 194(1), 77–105 (2013)MathSciNetCrossRefGoogle Scholar
  8. [vzGS92]
    von zur Gathen, J., Shoup, V.: Computing Frobenius maps and factoring polynomials. Comput. Complex. 2, 187–224 (1992)MathSciNetCrossRefGoogle Scholar
  9. [Gra08]
    Granville, A.: Smooth numbers: computational number theory and beyond. Algorithmic Number Theory 44, 267–323 (2008)MathSciNetzbMATHGoogle Scholar
  10. [How]
    Howe, E.: On the group orders of elliptic curves over finite fields. Compos. Math. 85, 229–247 (1993)MathSciNetzbMATHGoogle Scholar
  11. [KS99]
    Kaltofen, E., Shoup, V.: Fast polynomial factorization over high algebraic extensions of finite fields. In: Proceedings of the 1997 International Symposium Symbolic Algebraic Computation, (ISSAC 1997), pp. 184–188 (1997)Google Scholar
  12. [KU08]
    Kedlaya, K., Umans, C.: Fast modular composition in any characteristic. In: FOCS, pp. 146–155 (2008)Google Scholar
  13. [Lan78]
    Lang, S.: Algebraic groups over finite fields. Am. J. Math. 78, 555–563 (1956)MathSciNetCrossRefGoogle Scholar
  14. [Len87]
    Lenstra Jr., H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649–673 (1987)MathSciNetCrossRefGoogle Scholar
  15. [Moo1889]
    Moore, E.H.: A doubly-infinite system of simple groups. Bull. New York Math. Soc. 3, 73–78 (1893). Math. Papers read at the Congress of Mathematics (Chicago, 1893). Chicago 1896, pp. 208–242MathSciNetCrossRefGoogle Scholar
  16. [Nar2016]
    Narayanan, A.K.: Fast computation of isomorphisms between finite fields using elliptic curves.
  17. [Pin92]
    Pinch, R.G.E.: Recognizing elements of finite fields. Cryptography and Coding II, pp. 193–197 (1992)Google Scholar
  18. [Rai08]
    Rains, E.: Efficient computation of isomorphisms between finite fieldsGoogle Scholar
  19. [Sch95]
    Schoof, R.: Counting points on elliptic curves over finite fields. J. Theor. Nombres Bordeaux 7, 219–254 (1995)MathSciNetCrossRefGoogle Scholar
  20. [Sho99]
    Shoup, V.: Efficient computation of minimal polynomials in algebraic extensions of finite fields. In: ISSAC 1999, pp. 53–58 (1999)Google Scholar
  21. [Sho95]
    Shoup, V.: Fast construction of irreducible polynomials over finite fields. J. Symb. Comput. 17, 371–391 (1994)MathSciNetCrossRefGoogle Scholar
  22. [Zie74]
    Zierler, N.: A conversion algorithm for logarithms on \(GF(2^n)\). J. Pure Appl. Algebra 4, 353–356 (1974)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Laboratoire d’Informatique de Paris 6Sorbonne UniversiteParisFrance

Personalised recommendations