2021
DOI: 10.1016/j.ffa.2021.101881
|View full text |Cite
|
Sign up to set email alerts
|

New results on quasi-subfield polynomials

Abstract: 1 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.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Hence, System (31) is equivalent to 12 , N q 15 /q (a) = N q 15 /q (b) = −1, that is N q 15 /q 3 (b), N q 15 /q 3 (b) σ , N q 15 /q 3 (b) σ 2 are distinct solutions of…”
Section: A New Family Of σ-Linearized Trinomials With Maximum Kernelmentioning
confidence: 99%
“…Hence, System (31) is equivalent to 12 , N q 15 /q (a) = N q 15 /q (b) = −1, that is N q 15 /q 3 (b), N q 15 /q 3 (b) σ , N q 15 /q 3 (b) σ 2 are distinct solutions of…”
Section: A New Family Of σ-Linearized Trinomials With Maximum Kernelmentioning
confidence: 99%