Fast computation of isomorphisms between finite fields using elliptic curves

DOI10.1007/978-3-030-05153-2_4zbMath1446.11212arXiv1604.03072OpenAlexW2962837879MaRDI QIDQ1725937

Anand Kumar Narayanan

Publication date: 15 February 2019

Full work available at URL: https://arxiv.org/abs/1604.03072

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Related Items (3)

Fast computation of elliptic curve isogenies in characteristic two ⋮ On the complexity exponent of polynomial system solving ⋮ On the hardness of the finite field isomorphism problem

This page was built for publication: Fast computation of isomorphisms between finite fields using elliptic curves