English

Faster computation of isogenies of large prime degree

Cryptography and Security 2020-03-24 v1 Number Theory

Abstract

Let E/Fq\mathcal{E}/\mathbb{F}_q be an elliptic curve, and PP a point in E(Fq)\mathcal{E}(\mathbb{F}_q) of prime order \ell. V\'elu's formulae let us compute a quotient curve E=E/P\mathcal{E}' = \mathcal{E}/\langle{P}\rangle and rational maps defining a quotient isogeny ϕ:EE\phi: \mathcal{E} \to \mathcal{E}' in O~()\tilde{O}(\ell) Fq\mathbb{F}_q-operations, where the O~\tilde{O} is uniform in qq.This article shows how to compute E\mathcal{E}', and ϕ(Q)\phi(Q) for QQ in E(Fq)\mathcal{E}(\mathbb{F}_q), using only O~()\tilde{O}(\sqrt{\ell}) Fq\mathbb{F}_q-operations, where the O~\tilde{O} is again uniform in qq.As an application, this article speeds up some computations used in the isogeny-based cryptosystems CSIDH and CSURF.

Keywords

Cite

@article{arxiv.2003.10118,
  title  = {Faster computation of isogenies of large prime degree},
  author = {Daniel Bernstein and Luca de Feo and Antonin Leroux and Benjamin Smith},
  journal= {arXiv preprint arXiv:2003.10118},
  year   = {2020}
}