Zur Lösung von zahlentheoretischen Problemen mit klassischen und Quantencomputern

@inproceedings{Schmidt2007ZurLV,
  title={Zur L{\"o}sung von zahlentheoretischen Problemen mit klassischen und Quantencomputern},
  author={Arthur Schmidt},
  year={2007}
}
In this thesis, we will present and analyze algorithms for classical and quantum computers which solve some number theoretical problems. Moreover we will investigate their impact on current public key cryptosystems. In [Sho94] Shor presented quantum algorithms which determine the period lattice of some functions in quantum polynomial time. These algorithms can be applied to solve the factoring problem and the discrete logarithm problem in finite abelian groups in quantum polynomial time… CONTINUE READING