I am interested in the complexity theoretic equivalences of prime number factorization. I am especially interested to learn wether there are some not initially obvious reductions. Im sure there is a lot known already on the subject but i am not sure where to find a good resource on this.
Is there a review article or even better a database that comprehensively lists all known reductions to and from prime number factorization?
Have you checked out the Factoring Database? The wiki has plenty of information on how to use it if you have never used it before. I don't know of any other resource that you will find more useful for what you want.