New results on quasi-subfield polynomials

Abstract

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.

31 pages (Accepted manuscript) Finite Fields and Their Applications, Elsevier, In press, 75

References in corpus (3)

• A characterization of linearized polynomials with maximum kernel
• A Characterization of the Number of Roots of Linearized and Projective Polynomials in the Field of Coefficients
• MRD codes with maximum idealizers