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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
