Efficient Computation of $(3^n , 3^n)$-Isogenies - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Efficient Computation of $(3^n , 3^n)$-Isogenies

Thomas Decru

Résumé

The parametrization of $(3, 3)$-isogenies by Bruin, Flynn and Testa requires over 37.500 multiplications if one wants to evaluate a single isogeny in a point. We simplify their formulae and reduce the amount of required multiplications by 94%. Further we deduce explicit formulae for evaluating $(3, 3)$-splitting and gluing maps in the framework of the parametrization by Bröker, Howe, Lauter and Stevenhagen. We provide implementations to compute $(3^n , 3^n)$-isogenies between principally polarized abelian surfaces with a focus on cryptographic application. Our implementation can retrieve Alice's secret isogeny in 11 seconds for the SIKEp751 parameters, which were aimed at NIST level 5 security.
Fichier principal
Vignette du fichier
main.pdf (507.64 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Licence : CC BY - Paternité

Dates et versions

hal-04098198 , version 1 (15-05-2023)
hal-04098198 , version 2 (04-10-2023)

Licence

Paternité

Identifiants

Citer

Thomas Decru, Sabrina Kunzweiler. Efficient Computation of $(3^n , 3^n)$-Isogenies. 2023. ⟨hal-04098198v1⟩
50 Consultations
68 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More