Vulnerability of Cryptographic Primitives Based on the Power Conjugacy Search Problem in Quantum Computing

Abstract

This paper shows the existence of an efficient algorithm to solve the generalized discrete logarithm problem in quantum computing by reducing it to the Abelian hidden subgroup problem. The proposed method can also efficiently solve a partial power conjugacy search problem whose complexity in some groups underlies the resistance of several cryptographic systems and protocols in quantum computing.