A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves

DOI10.1007/978-3-319-13039-2_25zbMath1337.94024OpenAlexW189254053MaRDI QIDQ2945403

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

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

elliptic curve cryptographyisogeniessupersingular 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)

Related Items (27)

Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems ⋮ The Supersingular Isogeny Problem in Genus 2 and Beyond ⋮ Improved torsion-point attacks on SIDH variants ⋮ Trapdoor DDH groups from pairings and isogenies ⋮ On the hardness of the computational ring-LWR problem and its applications ⋮ A new adaptive attack on SIDH ⋮ On the Isogeny Problem with Torsion Point Information ⋮ Séta: Supersingular Encryption from Torsion Attacks ⋮ Adventures in Supersingularland ⋮ On the Security of Supersingular Isogeny Cryptosystems ⋮ A new isogeny representation and applications to cryptography ⋮ B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion ⋮ CSIDH: an efficient post-quantum commutative group action ⋮ Constructing Isogenies on Extended Jacobi Quartic Curves ⋮ Cycles in the Supersingular ℓ-Isogeny Graph and Corresponding Endomorphisms ⋮ 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 ⋮ Neighborhood of the supersingular elliptic curve isogeny graph at \(j = 0\) and 1728 ⋮ Ramanujan Graphs for Post-Quantum Cryptography ⋮ Constructing cycles in isogeny graphs of supersingular elliptic curves ⋮ Identification protocols and signature schemes based on supersingular isogeny problems ⋮ Limonnitsa: making Limonnik-3 post-quantum ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ Constructing an efficient hash function from $3$-isogenies ⋮ The Complexity of Public-Key Cryptography

This page was built for publication: A Quantum Algorithm for Computing Isogenies between Supersingular Elliptic Curves