Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
From MaRDI portal
Publication:2292880
DOI10.1007/978-3-030-17656-3_15OpenAlexW2902932547MaRDI QIDQ2292880
Lorenz Panny, Tanja Lange, Daniel J. Bernstein, Chloe Martindale
Publication date: 6 February 2020
Full work available at URL: https://research.tue.nl/nl/publications/27d3080c-b960-448c-8b56-cfba98f6f336
elliptic curvesquantum computationcircuitscryptanalysisisogeniesreversible computationconstant-time computation
Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (16)
Group Key Exchange from CSIDH and Its Application to Trusted Setup in Supersingular Isogeny Cryptosystems ⋮ CSIDH on the Surface ⋮ Hilbert modular polynomials ⋮ Disorientation faults in CSIDH ⋮ A direct key recovery attack on SIDH ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ Radical isogenies ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ A trade-off between classical and quantum circuit size for an attack against CSIDH ⋮ Post-Quantum Constant-Round Group Key Exchange from Static Assumptions ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ Threshold schemes from isogeny assumptions ⋮ Uniform encodings to elliptic curves and indistinguishable point representation ⋮ Optimal strategies for CSIDH ⋮ He gives C-sieves on the CSIDH ⋮ Quantum security analysis of CSIDH
This page was built for publication: Quantum circuits for the CSIDH: optimizing quantum evaluation of isogenies
