Quantum complexity for discrete logarithms and related problems

DOI10.1007/978-3-031-68391-6_1MaRDI QIDQ6652978zbMATH OpenFDO

Authors Minki Hhan, Takashi Yamakawa, Aaram Yun

Publication date 13 December 2024

Full work available at URL https://doi.org/10.1007/978-3-031-68391-6_1

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
• Constructing elliptic curve isogenies in quantum subexponential time
• Cryptography and Coding
• CSIDH: an efficient post-quantum commutative group action
• Depth efficient neural networks for division and related problems
• Full quantum equivalence of group action DLog and CDH, and more
• General linear group action on tensors: a candidate for post-quantum cryptography
• Generic Hardness of the Multiple Discrete Logarithm Problem
• He gives C-sieves on the CSIDH
• scientific article; zbMATH DE number 5320241 (Why is no real title available?)
• scientific article; zbMATH DE number 2085207 (Why is no real title available?)
• scientific article; zbMATH DE number 1406124 (Why is no real title available?)
• Improved quantum circuits for elliptic curve discrete logarithms
• New directions in cryptography
• Normal subgroup reconstruction and quantum computation using group representations
• On quantum algorithms for noncommutative hidden subgroups
• On the Equivalence of Generic Group Models
• On the Evaluation of Powers and Monomials
• On the need for large quantum depth
• Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
• Quantum algorithms for computing short discrete logarithms and factoring RSA integers
• Quantum Computation and Lattice Problems
• Quantum fan-out is powerful
• Quantum resource estimates for computing elliptic curve discrete logarithms
• Redeeming reset indifferentiability and applications to post-quantum security
• The ``Quantum annoying property of password-authenticated key exchange protocols
• The quantum query complexity of the abelian hidden subgroup problem
• The quantum query complexity of the hidden subgroup problem is polynomial
• The Symmetric Group Defies Strong Fourier Sampling
• To label, or not to label (in generic groups)

Cited in

(2)

• A new approach to generic lower bounds. Classical/quantum MDL, quantum factoring, and more
• Quantum money from abelian group actions

This page was built for publication: Quantum complexity for discrete logarithms and related problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652978)