2000 character limit reached
New results on quasi-subfield polynomials (1909.11326v2)
Published 25 Sep 2019 in cs.CR and math.NT
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.