par Galbraith, Steven S.D.;Granger, Robert;Merz, Simon Philipp;Petit, Christophe 
Référence Lecture notes in computer science, 12804 LNCS, page (115-138)
Publication Publié, 2021-10-01
Référence Lecture notes in computer science, 12804 LNCS, page (115-138)
Publication Publié, 2021-10-01
Article révisé par les pairs
| Résumé : | In this paper we further the study of index calculus methods for solving the elliptic curve discrete logarithm problem (ECDLP). We focus on the index calculus for subfield curves, also called Koblitz curves, defined over Fq with ECDLP in Fqn. Instead of accelerating the solution of polynomial systems during index calculus as was predominantly done in previous work, we define factor bases that are invariant under the q-power Frobenius automorphism of the field Fqn, reducing the number of polynomial systems that need to be solved. A reduction by a factor of 1/n is the best one could hope for. We show how to choose factor bases to achieve this, while simultaneously accelerating the linear algebra step of the index calculus method for Koblitz curves by a factor n2. Furthermore, we show how to use the Frobenius endomorphism to improve symmetry breaking for Koblitz curves. We provide constructions of factor bases with the desired properties, and we study their impact on the polynomial system solving costs experimentally. |
