A Fusion Algorithm for Solving the Hidden Shift Problem in Finite Abelian Groups

Published: 01 Jan 2021, Last Modified: 04 Mar 2025PQCrypto 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: It follows from a result by Friedl, Ivanyos, Magniez, Santha and Sen from 2014 that, for any fixed integer \(m > 0\) (thought of as being small), there exists a quantum algorithm for solving the hidden shift problem in an arbitrary finite abelian group \((G, +)\) with time complexity
Loading