A quantum algorithm for computing isogenies between supersingular elliptic curves

DOI10.1007/978-3-319-13039-2_25MaRDI QIDQ2945403zbMATH OpenOpenAlexFDO

Authors Jean-François Biasse, David D. Yao, Anirudh Sankar

Publication date 10 September 2015

Published in Progress in Cryptology -- INDOCRYPT 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13039-2_25

zbMATH Keywords

isogenieselliptic curve cryptographysupersingular curvesquantum safe cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum cryptography (quantum-theoretic aspects) (81P94)

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

(42)

• Identifying supersingular elliptic curves
• PRISM: simple and compact identification and signatures from large prime degree isogenies
• The supersingular isogeny problem in genus 2 and beyond
• On the isogeny problem with torsion point information
• Identification protocols and signature schemes based on supersingular isogeny problems
• Trapdoor DDH groups from pairings and isogenies
• Improved torsion-point attacks on SIDH variants
• SQIsign2D-West. The fast, the small, and the safer
• B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
• Constructing an efficient hash function from 3-isogenies
• Computational problems in supersingular elliptic curve isogenies
• On the hardness of the computational ring-LWR problem and its applications
• scientific article; zbMATH DE number 5320241 (Why is no real title available?)
• Orienting supersingular isogeny graphs
• A note on the security of CSIDH
• A new isogeny representation and applications to cryptography
• 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
• Quantum algorithm for solving hyperelliptic curve discrete logarithm problem
• Efficient post-quantum commutative group actions from orientations of large discriminant
• Faster cryptographic hash function from supersingular isogeny graphs
• Neighborhood of the supersingular elliptic curve isogeny graph at j = 0 and 1728
• A new adaptive attack on SIDH
• On the Security of Supersingular Isogeny Cryptosystems
• Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
• Ramanujan graphs for post-quantum cryptography
• Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms
• AprèsSQI: extra fast verification for SQIsign using extension-field signing
• Isogeny problems with level structure
• Constructing isogenies on extended Jacobi quartic curves
• Limonnitsa: making Limonnik-3 post-quantum
• New space-efficient quantum algorithm for binary elliptic curves using the optimized division algorithm
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
• Constructing elliptic curve isogenies in quantum subexponential time
• Séta: Supersingular Encryption from Torsion Attacks
• The Complexity of Public-Key Cryptography
• Adventures in Supersingularland
• Verifiable isogeny walks: towards an isogeny-based postquantum VDF
• Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems
• CSIDH: an efficient post-quantum commutative group action
• Avoiding trusted setup in isogeny-based commitments

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)