Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
From MaRDI portal
Publication:2958406
DOI10.4230/LIPIcs.TQC.2013.20zbMath1356.68076arXiv1112.3333OpenAlexW2242279290MaRDI QIDQ2958406
Publication date: 1 February 2017
Full work available at URL: https://arxiv.org/abs/1112.3333
Related Items (36)
SoK: how (not) to design and implement post-quantum cryptography ⋮ CSIDH on the Surface ⋮ Low-gate quantum golden collision finding ⋮ Quantum lattice enumeration and tweaking discrete pruning ⋮ On the hardness of the computational ring-LWR problem and its applications ⋮ Hidden shift quantum cryptanalysis and implications ⋮ Post-quantum adaptor signature for privacy-preserving off-chain payments ⋮ Practical post-quantum signature schemes from isomorphism problems of trilinear forms ⋮ New results on quantum boomerang attacks ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ A lower bound on the length of signatures based on group actions and generic isogenies ⋮ A subexponential-time, polynomial quantum space algorithm for inverting the CM group action ⋮ Quantum impossible differential attacks: applications to AES and SKINNY ⋮ Full quantum equivalence of group action DLog and CDH, and more ⋮ Take your MEDS: digital signatures from matrix code equivalence ⋮ \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist ⋮ Quantum algorithm based on the \(\varepsilon\)-random linear disequations for the continuous hidden shift problem ⋮ Quantum time/memory/data tradeoff attacks ⋮ Two remarks on the vectorization problem ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Cryptographic group actions and applications ⋮ Estimating quantum speedups for lattice sieves ⋮ Improved classical and quantum algorithms for subset-sum ⋮ Towards practical key exchange from ordinary isogeny graphs ⋮ CSIDH: an efficient post-quantum commutative group action ⋮ Quantum pattern matching fast on average ⋮ 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 ⋮ Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 ⋮ Threshold schemes from isogeny assumptions ⋮ Leveraging the hardness of dihedral coset problem for quantum cryptography ⋮ Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts ⋮ A fusion algorithm for solving the hidden shift problem in finite abelian groups ⋮ Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms ⋮ He gives C-sieves on the CSIDH ⋮ Quantum security analysis of CSIDH
This page was built for publication: Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
