Efficient supersingularity testing over F_p and CSIDH key validation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Mathematical Cryptology Année : 2022

Efficient supersingularity testing over F_p and CSIDH key validation

Résumé

Many public-key cryptographic protocols, notably non-interactive key exchange (NIKE), require incoming public keys to be validated to mitigate some adaptive attacks. In CSIDH, an isogeny-based post-quantum NIKE, a key is deemed legitimate if the given Montgomery coefficient specifies a supersingular elliptic curve over the prime field. In this work, we survey the current supersingularity tests used for CSIDH key validation, and implement and measure two new alternative algorithms. Our implementation shows that we can determine supersingularity substantially faster, and using less memory, than the state-of-the-art.
Fichier principal
Vignette du fichier
main.pdf (272.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03739021 , version 1 (28-07-2022)

Identifiants

  • HAL Id : hal-03739021 , version 1

Citer

Gustavo Banegas, Valerie Gilchrist, Benjamin Smith. Efficient supersingularity testing over F_p and CSIDH key validation. Mathematical Cryptology, 2022, 2 (1), pp.21-35. ⟨hal-03739021⟩
133 Consultations
119 Téléchargements

Partager

Gmail Facebook X LinkedIn More