Time and Query Complexity Tradeoffs for the Dihedral Coset Problem

DOI10.1007/978-3-031-40003-2_19MaRDI QIDQ6493402zbMATH OpenFDO

Authors Maxime Remaud, André Schrottenloher, Jean-Pierre Tillich

Publication date 26 April 2024

Full work available at URL https://doi.org/10.1007/978-3-031-40003-2_19

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• The dihedral hidden subgroup problem
• Improved classical and quantum algorithms for subset-sum
• How hard is deciding trivial versus nontrivial in the dihedral coset problem?

Cites work

• A method for obtaining digital signatures and public-key cryptosystems
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Constructing elliptic curve isogenies in quantum subexponential time
• Cryptographic group actions and applications
• CSI-FiSh: efficient isogeny based signatures through class group computations
• CSIDH: an efficient post-quantum commutative group action
• Efficient public key encryption based on ideal lattices (extended abstract)
• Faster SeaSign signatures through improved rejection sampling
• He gives C-sieves on the CSIDH
• scientific article; zbMATH DE number 1304334 (Why is no real title available?)
• scientific article; zbMATH DE number 1942427 (Why is no real title available?)
• scientific article; zbMATH DE number 1559544 (Why is no real title available?)
• Improved classical and quantum algorithms for subset-sum
• Improved Generic Algorithms for Hard Knapsacks
• New directions in cryptography
• New generic algorithms for hard knapsacks
• New lattice-based cryptographic constructions
• On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
• Quantum algorithms for the subset-sum problem
• Quantum cryptanalysis of hash and claw-free functions
• Quantum security analysis of CSIDH
• SeaSign: compact isogeny signatures from class group actions
• Subset Sum Quantumly in 1.17 n .
• The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
• The quantum query complexity of the hidden subgroup problem is polynomial

This page was built for publication: Time and Query Complexity Tradeoffs for the Dihedral Coset Problem

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