Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
From MaRDI portal
Publication:6493402
DOI10.1007/978-3-031-40003-2_19MaRDI QIDQ6493402
Jean-Pierre Tillich, André Schrottenloher, Maxime Remaud
Publication date: 26 April 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CSIDH: an efficient post-quantum commutative group action
- He gives C-sieves on the CSIDH
- Quantum security analysis of CSIDH
- CSI-FiSh: efficient isogeny based signatures through class group computations
- SeaSign: compact isogeny signatures from class group actions
- Faster SeaSign signatures through improved rejection sampling
- The quantum query complexity of the hidden subgroup problem is polynomial
- Cryptographic group actions and applications
- Improved classical and quantum algorithms for subset-sum
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Improved Generic Algorithms for Hard Knapsacks
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- New Generic Algorithms for Hard Knapsacks
- Efficient Public Key Encryption Based on Ideal Lattices
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Quantum Algorithms for the Subset-Sum Problem
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
- Constructing elliptic curve isogenies in quantum subexponential time
- New lattice-based cryptographic constructions
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Quantum cryptanalysis of hash and claw-free functions
- Subset Sum Quantumly in 1.17 n .
This page was built for publication: Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
