1. Daniel J. Bernstein, Multidigit multiplication for mathematicians, http://cr.yp.to/papers.html . Zugegriffen am 1. April 2016
2. L. Blum, M. Blum, M. Shub, A simple unpredictable pseudorandom number generator. SIAM J. Comput. 15(2), 364–383 (1986)
3. Manuel Blum, Shafi Goldwasser, An efficient probabilistic public-key encryption scheme which hides all partial information, in CRYPTO ’84: Proceedings of the 4th Annual International Cryptology Conference, Advances in Cryptology (1984), S. 289–302
4. Dan Boneh, Ron Rivest, Adi Shamir, Len Adleman, Twenty Years of Attacks on the RSA Cryptosystem. Notices of the AMS 46, 203–213 (1999)
5. Çetin Kaya Koç, Tolga Acar, Burton S. Kaliski, Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26–33 (1996)