DARTOIS, Pierrick; MAINO, Luciano; POPE, Giacomo; ROBERT, Damien

Métadonnées

Licence d’utilisation du document

DARTOIS, Pierrick
Institut de Mathématiques de Bordeaux [IMB]
Analyse cryptographique et arithmétique [CANARI]
Lithe and fast algorithmic number theory [LFANT]

MAINO, Luciano
University of Bristol [Bristol]

POPE, Giacomo
NCC Group
University of Bristol [Bristol]

Langue

Document de travail - Pré-publication

Résumé en anglais

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.< Réduire

Mots clés en anglais

Post-Quantum Cryptography

Isogenies

Theta coordinates

Dimension 2

URI

https://oskar-bordeaux.fr/handle/20.500.12278/190386

Project ANR

Cryptographie, isogenies et variété abéliennes surpuissantes - ANR-19-CE48-0008
Post-quantum padlock for web browser - ANR-22-PETQ-0008

Origine

Importé de hal

Unités de recherche

Institut de Mathématiques de Bordeaux (IMB) - UMR 5251