par Euler, Marie;Petit, Christophe
Référence Finite fields and their applications, 75, 101881
Publication A Paraître, 2021-10-31
Article révisé par les pairs
Résumé : Quasi-subfield polynomials were introduced by Huang et al. together with a new algorithm to solve the Elliptic Curve Discrete Logarithm Problem (ECDLP) over finite fields of small characteristic. In this paper we provide both new quasi-subfield polynomial families and a new theorem limiting their existence. Our results do not allow to derive any speedup for the new ECDLP algorithm compared to previous approaches.