Classical HSP for abelian groups

Niklas Julius Müller, available immediately

The Hidden Supgroup Problem (HSP) searches for a Group H “hidden” by a function f, i.e., f(x) = f(x+h) for all h \in H. The algorithm of Shor solves this problem on a quantum computer for finite abelian groups and \Z. The aim of this Bachelor thesis would be to find and compare classical algorithms to the widely known quantum algorithms.

Requirements

• Quantenalgorithmen und Kryptoanalyse