Prime factorization is an interesting problem as it is not efficiently solvable on a classical computer with any known algorithm. This fact is used in modern cryptograpy methods. In this thesis, a method based on simulated annealing will be examined. It could be shown that one factorization step can be done in polynomial time.
The thesis and the talk are written in German. You can find final versions in the final folder.
I am not very happy with the code of the programs I wrote, so I started the primefac-project. Go check it out!
- GNU make 4.0
- Cmake 3.0.0
- TeXLive 2014
- Biber 1.9
- Rubber 1.1
- Python 3.4.1
- GNU Compiler Collection 4.9.0
- scipy 0.14.0
- numpy 1.8.1
- matplotlib 1.3.1