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.

翻译：黄四郎等人引入了准子场多语种,同时引入了一种新的算法,以解决小特性的有限字段的椭圆曲线分解逻辑问题(ECDLP ) 。 在本文中,我们既提供了新的准子场多语种家庭,也提供了限制其存在的新理论。我们的结果不允许与以往方法相比,为新的 ECDLP 算法加快速度。