Paper 2023/1747

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

Pierrick Dartois, Inria Bordeaux - Sud-Ouest Research Centre, Institut de Mathématiques de Bordeaux
Luciano Maino, University of Bristol
Giacomo Pope, University of Bristol, NCC Group
Damien Robert, Inria Bordeaux - Sud-Ouest Research Centre, Institut de Mathématiques de Bordeaux
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.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
A minor revision of an IACR publication in ASIACRYPT 2024
DOI
10.1007/978-981-96-0891-1_10
Keywords
isogeniesabelian surfacestheta modelpost-quantum cryptographyimplementation
Contact author(s)
pierrick dartois @ u-bordeaux fr
luciano maino @ bristol ac uk
giacomo pope @ nccgroup com
damien robert @ inria fr
History
2024-12-19: last of 3 revisions
2023-11-11: received
See all versions
Short URL
https://ia.cr/2023/1747
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2023/1747,
      author = {Pierrick Dartois and Luciano Maino and Giacomo Pope and Damien Robert},
      title = {An Algorithmic Approach to $(2,2)$-isogenies in the Theta Model and Applications to Isogeny-based Cryptography},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1747},
      year = {2023},
      doi = {10.1007/978-981-96-0891-1_10},
      url = {https://eprint.iacr.org/2023/1747}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.