On the security of OSIDH
From MaRDI portal
Recommendations
Cites work
- A hierarchy of polynomial time lattice basis reduction algorithms
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Abelian varieties over finite fields
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- Cryptographic group actions and applications
- CSI-FiSh: efficient isogeny based signatures through class group computations
- CSIDH: an efficient post-quantum commutative group action
- Faster algorithms for isogeny problems using torsion point images
- He gives C-sieves on the CSIDH
- scientific article; zbMATH DE number 435565 (Why is no real title available?)
- scientific article; zbMATH DE number 3908520 (Why is no real title available?)
- scientific article; zbMATH DE number 503244 (Why is no real title available?)
- scientific article; zbMATH DE number 706265 (Why is no real title available?)
- scientific article; zbMATH DE number 2086697 (Why is no real title available?)
- scientific article; zbMATH DE number 6164023 (Why is no real title available?)
- scientific article; zbMATH DE number 3356934 (Why is no real title available?)
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
- Low-gate quantum golden collision finding
- Modular polynomials via isogeny volcanoes
- New directions in nearest neighbor searching with applications to lattice sieving
- Oblivious pseudorandom functions from isogenies
- On oriented supersingular elliptic curves
- On the quaternion -isogeny path problem
- On the security of OSIDH
- Orienting supersingular isogeny graphs
- Quantum security analysis of CSIDH
- Random sampling revisited: lattice enumeration with discrete pruning
- SeaSign
- SeaSign: compact isogeny signatures from class group actions
- Semi-commutative Masking: A Framework for Isogeny-Based Protocols, with an Application to Fully Secure Two-Round Isogeny-Based OT
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- The Arithmetic of Elliptic Curves
- The nearest-colattice algorithm: time-approximation tradeoff for approx-CVP
- The randomized slicer for CVPP: sharper, faster, smaller, batchier
- Threshold schemes from isogeny assumptions
Cited in
(16)- On oriented supersingular elliptic curves
- On collisions related to an ideal class of order 3 in CSIDH
- On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
- Improved torsion-point attacks on SIDH variants
- An exposure model for supersingular isogeny Diffie-Hellman key exchange
- On the security of OSIDH
- SCALLOP: scaling the CSI-FiSh
- Orienteering with one endomorphism
- Full quantum equivalence of group action DLog and CDH, and more
- Weak instances of class group action based cryptography via self-pairings
- New SIDH countermeasures for a more efficient key exchange
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- Deterministic algorithms for class group actions
- Efficient post-quantum commutative group actions from orientations of large discriminant
- On the active security of the PEARL-SCALLOP group action
- On the (non-)existence of efficient class group orbits for collision search in CSIDH
This page was built for publication: On the security of OSIDH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087250)
