The Hidden Subgroup Problem and Post-quantum Group-based Cryptography

2018/05/10 by Horan, Kelsey, Kahrobaei, Delaram · 1 citation
#Computational Complexity (cs.CC) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Group Theory (math.GR) #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.1805.04179

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.

Cited by

• A survey about Hidden Subgroup Problem from a mathematical and cryptographic perspective

Related

• A survey about Hidden Subgroup Problem from a mathematical and cryptographic perspective
• Towards a Group Theoretic Quantum Encryption Scheme Based on Generalized Hidden Subgroup Problem
• The Hidden Subgroup Problem - Review and Open Problems
• Group-based Cryptography in the Quantum Era
• A Note on the Quantum Query Complexity of the Hidden Subgroup Problem