New results on quasi-subfield polynomials
Cryptography and Security
2021-06-28 v2 Number Theory
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.
Cite
@article{arxiv.1909.11326,
title = {New results on quasi-subfield polynomials},
author = {M. Euler and C. Petit},
journal= {arXiv preprint arXiv:1909.11326},
year = {2021}
}
Comments
31 pages (Accepted manuscript) Finite Fields and Their Applications, Elsevier, In press, 75