The hidden subgroup problem and post-quantum group-based cryptography

DOI10.1007/978-3-319-96418-8_26MaRDI QIDQ1662239zbMATH OpenOpenAlexFDO

Authors Kelsey Horan, Delaram Kahrobaei

Publication date 17 August 2018

Full work available at URL https://arxiv.org/abs/1805.04179

zbMATH Keywords

quantum computationgroup-based cryptographypost-quantum cryptographyhidden subgroup problem

Mathematics Subject Classification ID

Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Abstract: In this paper we discuss the Hidden Subgroup Problem (HSP) in relation to post-quantum group-based cryptography. We review the relationship between HSP and other computational problems discuss an optimal solution method, and review the known results about the quantum complexity of HSP. We also overview some platforms for group-based cryptosystems. Notably, efficient algorithms for solving HSP in such infinite group platforms are not yet known.

Recommendations

• Harmonic analysis on finite groups, number theory and efficient quantum cryptographic algorithms.
• The hidden subgroup problem for universal algebras
• On the quantum complexity of the continuous hidden subgroup problem
• On the complexity of the hidden subgroup problem
• Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups

Cited in

(14)

• Vulnerability of cryptographic primitives based on the power conjugacy search problem in quantum computing
• Leveraging the hardness of dihedral coset problem for quantum cryptography
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• Semidirect product key exchange: the state of play
• Algorithmic problems in Engel groups and cryptographic applications
• Harmonic analysis on finite groups, number theory and efficient quantum cryptographic algorithms.
• An Efficient Construction of Quantum Attack Resistant Proxy Re-Encryption Based on (Semi)group Factorization Problems*
• Post-Quantum Constant-Round Group Key Exchange from Static Assumptions
• Efficient and secure delegation of exponentiation in general groups to a single malicious server
• Zero sum subsequences and hidden subgroups
• Reduction of the semigroup-action problem on a module to the hidden-subgroup problem
• scientific article; zbMATH DE number 5025700 (Why is no real title available?)
• General linear group action on tensors: a candidate for post-quantum cryptography
• The dihedral hidden subgroup problem

Describes a project that uses

Uses Software

• WalnutDSA

This page was built for publication: The hidden subgroup problem and post-quantum group-based cryptography

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