International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

An Algorithmic Approach to $(2,2)$-isogenies in the Theta Model and Applications to Isogeny-based Cryptography

Authors:
Pierrick Dartois , University of Bordeaux, Inria Bordeaux
Luciano Maino , University of Bristol
Giacomo Pope , NCC Group, University of Bristol
Damien Robert , University of Bordeaux, Inria Bordeaux
Download:
Search ePrint
Search Google
Presentation: Slides
Conference: ASIACRYPT 2024
Abstract: In this paper, we describe an algorithm to compute chains of $(2,2)$-isogenies between products of elliptic curves in the theta model. The description of the algorithm is split into various subroutines to allow for a precise field operation counting. We present a constant time implementation of our algorithm in Rust and an alternative implementation in SageMath. Our work in SageMath runs ten times faster than a comparable implementation of an isogeny chain using the Richelot correspondence. The Rust implementation runs up to forty times faster than the equivalent isogeny in SageMath and has been designed to be portable for future research in higher-dimensional isogeny-based cryptography.
BibTeX
@inproceedings{asiacrypt-2024-34668,
  title={An Algorithmic Approach to $(2,2)$-isogenies in the Theta Model and Applications to Isogeny-based Cryptography},
  publisher={Springer-Verlag},
  author={Pierrick Dartois and Luciano Maino and Giacomo Pope and Damien Robert},
  year=2024
}