On the Security of OSIDH
From MaRDI portal
Publication:5087250
DOI10.1007/978-3-030-97121-2_3zbMath1502.81026OpenAlexW4214534403MaRDI QIDQ5087250
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_3
Cryptography (94A60) Elliptic curves (14H52) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
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, On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- Low-gate quantum golden collision finding
- A hierarchy of polynomial time lattice basis reduction algorithms
- SeaSign
- Supersingular isogeny graphs and endomorphism rings: reductions and solutions
- Faster algorithms for isogeny problems using torsion point images
- CSIDH: an efficient post-quantum commutative group action
- On oriented supersingular elliptic curves
- Orienting supersingular isogeny graphs
- The randomized slicer for CVPP: sharper, faster, smaller, batchier
- Threshold schemes from isogeny assumptions
- Compact, efficient and UC-secure isogeny-based oblivious transfer
- He gives C-sieves on the CSIDH
- Quantum security analysis of CSIDH
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- Cryptographic group actions and applications
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices
- Oblivious pseudorandom functions from isogenies
- On the quaternion -isogeny path problem
- Structure computation and discrete logarithms in finite abelian $p$-groups
- The Arithmetic of Elliptic Curves
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- New directions in nearest neighbor searching with applications to lattice sieving
- On the Security of OSIDH
- Modular polynomials via isogeny volcanoes
- Abelian varieties over finite fields
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
- The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP
