A review of mathematical and computational aspects of CSIDH algorithms
From MaRDI portal
Publication:6580190
DOI10.1142/S0219498825300028zbMATH Open1544.94266MaRDI QIDQ6580190FDOQ6580190
Authors: Luciano Maino, Marzio Mula, Federico Pintore 
Publication date: 29 July 2024
Published in: Journal of Algebra and its Applications (Search for Journal in Brave)
Recommendations
Cryptography (94A60) Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16) Quantum cryptography (quantum-theoretic aspects) (81P94) Elliptic curves (14H52) Isogeny (14K02)
Cites Work
- On lions and elligators: an efficient constant-time implementation of CSIDH
- Elliptic curves and their applications to cryptography. An introduction
- The Arithmetic of Elliptic Curves
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Abelian varieties over finite fields
- Twisted Edwards Curves
- Elliptic curves. Number theory and cryptography
- Binary quadratic forms. An algorithmic approach
- Modern computer algebra
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Title not available (Why is that?)
- On Lovász' lattice reduction and the nearest lattice point problem
- Title not available (Why is that?)
- Endomorphisms of Abelian varieties over finite fields
- Constructing elliptic curve isogenies in quantum subexponential time
- Title not available (Why is that?)
- Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Isogeny volcanoes
- Fast heuristic algorithms for computing relations in the class group of a quadratic order, with applications to isogeny evaluation
- Title not available (Why is that?)
- CSIDH on the surface
- CSIDH: an efficient post-quantum commutative group action
- Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
- Sieving for closest lattice vectors (with preprocessing)
- Towards practical key exchange from ordinary isogeny graphs
- He gives C-sieves on the CSIDH
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- Finding closest lattice vectors using approximate Voronoi cells
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512
- Faster computation of isogenies of large prime degree
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Polynomial multiplication over finite fields in time \(O(n\log n)\)
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- A faster way to the CSIDH
- On collisions related to an ideal class of order 3 in CSIDH
- Rational isogenies from irrational endomorphisms
- Stronger and faster side-channel protections for CSIDH
- Optimal strategies for CSIDH
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- \( L_1\)-norm ball for CSIDH: optimal strategy for choosing the secret key space
- Radical isogenies
- SCALLOP: scaling the CSI-FiSh
- A lower bound on the length of signatures based on group actions and generic isogenies
- Full quantum equivalence of group action DLog and CDH, and more
- Horizontal racewalking using radical isogenies
Cited In (2)
This page was built for publication: A review of mathematical and computational aspects of CSIDH algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580190)
