SCALLOP: scaling the CSI-FiSh
WESOLOWSKI, Benjamin
Lithe and fast algorithmic number theory [LFANT]
Unité de Mathématiques Pures et Appliquées [UMPA-ENSL]
Centre National de la Recherche Scientifique [CNRS]
Analyse cryptographique et arithmétique [CANARI]
< Réduire
Lithe and fast algorithmic number theory [LFANT]
Unité de Mathématiques Pures et Appliquées [UMPA-ENSL]
Centre National de la Recherche Scientifique [CNRS]
Analyse cryptographique et arithmétique [CANARI]
Langue
en
Communication dans un congrès
Ce document a été publié dans
PKC 2023, 2023-05-07, Atlanta. 2023-05-02, vol. 13940, p. 345-375
Springer Nature Switzerland
Résumé en anglais
We present SCALLOP: SCALable isogeny action based on Oriented supersingular curves with Prime conductor, a new group action based on isogenies of supersingular curves. Similarly to CSIDH and OSIDH, we use the group action ...Lire la suite >
We present SCALLOP: SCALable isogeny action based on Oriented supersingular curves with Prime conductor, a new group action based on isogenies of supersingular curves. Similarly to CSIDH and OSIDH, we use the group action of an imaginary quadratic order’s class group on the set of oriented supersingular curves. Compared to CSIDH, the main benefit of our construction is that it is easy to compute the class-group structure; this data is required to uniquely represent—and efficiently act by — arbitrary group elements, which is a requirement in, e.g., the CSI-FiSh signature scheme by Beullens, Kleinjung and Vercauteren. The index-calculus algorithm used in CSI-FiSh to compute the class-group structure has complexity L(1/2), ruling out class groups much larger than CSIDH-512, a limitation that is particularly problematic in light of the ongoing debate regarding the quantum security of cryptographic group actions.Hoping to solve this issue, we consider the class group of a quadratic order of large prime conductor inside an imaginary quadratic field of small discriminant. This family of quadratic orders lets us easily determine the size of the class group, and, by carefully choosing the conductor, even exercise significant control on it—in particular supporting highly smooth choices. Although evaluating the resulting group action still has subexponential asymptotic complexity, a careful choice of parameters leads to a practical speedup that we demonstrate in practice for a security level equivalent to CSIDH-1024, a parameter currently firmly out of reach of index-calculus-based methods. However, our implementation takes 35 seconds (resp. 12.5 minutes) for a single group-action evaluation at a CSIDH-512-equivalent (resp. CSIDH-1024-equivalent) security level, showing that, while feasible, the SCALLOP group action does not achieve realistically usable performance yet.< Réduire
Project ANR
Méthodes pour les variétés abéliennes de petite dimension - ANR-20-CE40-0013
Post-quantum padlock for web browser - ANR-22-PETQ-0008
Centre de Mathématiques Henri Lebesgue : fondements, interactions, applications et Formation - ANR-11-LABX-0020
Post-quantum padlock for web browser - ANR-22-PETQ-0008
Centre de Mathématiques Henri Lebesgue : fondements, interactions, applications et Formation - ANR-11-LABX-0020
Origine
Importé de halUnités de recherche