Leveraging the hardness of dihedral coset problem for quantum cryptography

DOI10.1007/s11128-022-03592-9OpenAlexW4296309231WikidataQ114223651 ScholiaQ114223651MaRDI QIDQ2104711

Jingwen Suo, Lize Gu, Li-Cheng Wang, Xing-Yu Yan

Publication date: 7 December 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-022-03592-9

zbMATH Keywords

quantum key agreementdihedral hidden subgroup problemdihedral coset stateoptimal measurement attack

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Protocols of quantum key agreement solely using Bell states and Bell measurement
• Improvement on ``quantum key agreement protocol with maximally entangled states
• New quantum key agreement protocols based on cluster states
• Quantum key agreement protocols with four-qubit cluster states
• Hidden shift quantum cryptanalysis and implications
• The hidden subgroup problem and post-quantum group-based cryptography
• Learning with errors and extrapolated dihedral cosets
• Multi-party quantum key agreement with Bell states and Bell measurements
• Quantum algorithms for typical hard problems: a perspective of cryptanalysis
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Quantum algorithms for algebraic problems
• Optimal measurements for the dihedral hidden subgroup problem
• On the Power of Quantum Computation
• Quantum cryptography based on Bell’s theorem
• Quantum Computation and Lattice Problems
• Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
• How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Problem
• Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
• Quantum cryptography
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Limitations of quantum coset states for graph isomorphism
• On lattices, learning with errors, random linear codes, and cryptography
• On quantum algorithms for noncommutative hidden subgroups

This page was built for publication: Leveraging the hardness of dihedral coset problem for quantum cryptography