L₁-norm ball for CSIDH: optimal strategy for choosing the secret key space
From MaRDI portal
Publication:2685697
Recommendations
Cites work
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- A faster way to the CSIDH
- A simple and compact algorithm for SIDH with arbitrary degree isogenies
- Analogues of Vélu's formulas for isogenies on alternate models of elliptic curves
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH on the surface
- CSIDH: an efficient post-quantum commutative group action
- Computing isogenies between Montgomery curves using the action of \((0,0)\)
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Constructing isogenies on extended Jacobi quartic curves
- Faster computation of isogenies of large prime degree
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors
- He gives C-sieves on the CSIDH
- How to construct CSIDH on Edwards curves
- On lions and elligators: an efficient constant-time implementation of CSIDH
- Optimized method for computing odd-degree isogenies on Edwards curves
- Quantum security analysis of CSIDH
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- Stronger and faster side-channel protections for CSIDH
- The Arithmetic of Elliptic Curves
- The LLL algorithm. Survey and applications
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited in
(3)
This page was built for publication: \( L_1\)-norm ball for CSIDH: optimal strategy for choosing the secret key space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2685697)