English

Extending the GLS endomorphism to speed up GHS Weil descent using Magma

Cryptography and Security 2021-06-21 v1

Abstract

Let q=2nq = 2^n, and let E/FqE / \mathbb{F}_{q^{\ell}} be a generalized Galbraith--Lin--Scott (GLS) binary curve, with 2\ell \ge 2 and (,n)=1(\ell, n) = 1.We show that the GLS endomorphism on E/FqE / \mathbb{F}_{q^{\ell}} induces an efficient endomorphism on the Jacobian JH(Fq)J_H(\mathbb{F}_q) of the genus-gg hyperelliptic curve HH corresponding to the image of the GHS Weil-descent attack applied to E/FqE/\mathbb{F}_{q^\ell}, and that this endomorphism yields a factor-nn speedup when using standard index-calculus procedures for solving the Discrete Logarithm Problem (DLP) on JH(Fq)J_H(\mathbb{F}_q). Our analysis is backed up by the explicit computation of a discrete logarithm defined on a prime-order subgroup of a GLS elliptic curve over the field F2531\mathbb{F}_{2^{5\cdot 31}}. A Magma implementation of our algorithm finds the aforementioned discrete logarithm in about 1,0351,035 CPU-days.

Keywords

Cite

@article{arxiv.2106.09967,
  title  = {Extending the GLS endomorphism to speed up GHS Weil descent using Magma},
  author = {Jesús-Javier Chi-Domínguez and Francisco Rodríguez-Henríquez and Benjamin Smith},
  journal= {arXiv preprint arXiv:2106.09967},
  year   = {2021}
}

Comments

Finite Fields and Their Applications, Elsevier, In press, 75