Leveraging the hardness of dihedral coset problem for quantum cryptography

DOI10.1007/S11128-022-03592-9MaRDI QIDQ2104711zbMATH OpenOpenAlexWikidataFDO

Authors Lize Gu, Jingwen Suo, Xing-Yu Yan, Licheng Wang

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)

Recommendations

• Computational indistinguishability between quantum states and its cryptographic application
• Computational Indistinguishability Between Quantum States and Its Cryptographic Application
• Learning with errors and extrapolated dihedral cosets
• High-dimensional quantum key distribution based on qudits transmission with quantum Fourier transform
• Quantum cryptography based on an algorithm for determining a function using qudit systems

Cites work

• scientific article; zbMATH DE number 1030974 (Why is no real title available?)
• scientific article; zbMATH DE number 1559521 (Why is no real title available?)
• A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
• Hidden shift quantum cryptanalysis and implications
• How hard is deciding trivial versus nontrivial in the dihedral coset problem?
• Improvement on ``quantum key agreement protocol with maximally entangled states
• Learning with errors and extrapolated dihedral cosets
• Multi-party quantum key agreement with Bell states and Bell measurements
• New quantum key agreement protocols based on cluster states
• On lattices, learning with errors, random linear codes, and cryptography
• On quantum algorithms for noncommutative hidden subgroups
• On the Power of Quantum Computation
• Optimal measurements for the dihedral hidden subgroup problem
• Protocols of quantum key agreement solely using Bell states and Bell measurement
• Quantum Algorithms for Abelian Difference Sets and Applications to Dihedral Hidden Subgroups
• Quantum Computation and Lattice Problems
• Quantum algorithm for a generalized hidden shift problem
• Quantum algorithms for algebraic problems
• Quantum algorithms for typical hard problems: a perspective of cryptanalysis
• Quantum cryptography
• Quantum cryptography based on Bell’s theorem
• Quantum cryptography: public key distribution and coin tossing
• Quantum key agreement protocols with four-qubit cluster states
• Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts
• The hidden subgroup problem and post-quantum group-based cryptography

Cited in

(2)

• Computational Indistinguishability Between Quantum States and Its Cryptographic Application
• Post-quantum \(\kappa\)-to-1 trapdoor claw-free functions from extrapolated dihedral cosets

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

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