A quantum algorithm for computing isogenies between supersingular elliptic curves
From MaRDI portal
Recommendations
- Computational problems in supersingular elliptic curve isogenies
- A note on the security of CSIDH
- Computing isogenies between supersingular elliptic curves over \(\mathbb {F}_p\)
- Constructing elliptic curve isogenies in quantum subexponential time
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography
Cited in
(45)- On the hardness of the computational ring-LWR problem and its applications
- CSIDH: an efficient post-quantum commutative group action
- A note on the security of CSIDH
- Computational problems in supersingular elliptic curve isogenies
- Orienting supersingular isogeny graphs
- A trade-off between classical and quantum circuit size for an attack against CSIDH
- Algebraic approaches for solving isogeny problems of prime power degrees
- Constructing cycles in isogeny graphs of supersingular elliptic curves
- Improved torsion-point attacks on SIDH variants
- A new adaptive attack on SIDH
- Neighborhood of the supersingular elliptic curve isogeny graph at j = 0 and 1728
- Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- On the Security of Supersingular Isogeny Cryptosystems
- Constructing isogenies on extended Jacobi quartic curves
- Constructing an efficient hash function from 3-isogenies
- Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
- Limonnitsa: making Limonnik-3 post-quantum
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- Ramanujan graphs for post-quantum cryptography
- The Complexity of Public-Key Cryptography
- Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems
- The supersingular isogeny problem in genus 2 and beyond
- On the isogeny problem with torsion point information
- Identifying supersingular elliptic curves
- Constructing elliptic curve isogenies in quantum subexponential time
- Identification protocols and signature schemes based on supersingular isogeny problems
- Séta: Supersingular Encryption from Torsion Attacks
- New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
- Adventures in Supersingularland
- A new isogeny representation and applications to cryptography
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Faster cryptographic hash function from supersingular isogeny graphs
- AprèsSQI: extra fast verification for SQIsign using extension-field signing
- Isogeny problems with level structure
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Avoiding trusted setup in isogeny-based commitments
- PRISM: simple and compact identification and signatures from large prime degree isogenies
- SQIsign2D-West. The fast, the small, and the safer
- Efficient post-quantum commutative group actions from orientations of large discriminant
- Another look at the quantum security of the vectorization problem with shifted inputs
- The supersingular endomorphism ring problem given one endomorphism
- Attacks on PRISM-id via torsion over small extension fields
- Trapdoor DDH groups from pairings and isogenies
This page was built for publication: A quantum algorithm for computing isogenies between supersingular elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945403)
