A trade-off between classical and quantum circuit size for an attack against CSIDH
We propose a heuristic algorithm to solve the underlying hard problem of the CSIDH cryptosystem (and other isogeny-based cryptosystems using elliptic curves with endomorphism ring isomorphic to an imaginary quadratic order 𝒪). Let Δ = Disc(𝒪) (in CSIDH, Δ = −4p for p the security parameter). Let 0 &...
Main Authors: | Biasse Jean-François, Bonnetain Xavier, Pring Benjamin, Schrottenloher André, Youmans William |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2020-11-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2020-0070 |
Similar Items
-
An efficient post-quantum KEM from CSIDH
by: Qi Mingping
Published: (2022-06-01) -
Practical Usage of Radical Isogenies for CSIDH
by: Donghoe Heo, et al.
Published: (2023-01-01) -
The dihedral hidden subgroup problem
by: Chen Imin, et al.
Published: (2024-03-01) -
Quantum computation of discrete logarithms in semigroups
by: Childs Andrew M., et al.
Published: (2014-12-01) -
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
by: Ekerå Martin
Published: (2021-04-01)