This post covers more of the number theory I found useful for understanding the basics of public key cryptography. I've covered Fermat's little Theorem, Euler's Theorem, eth roots, and discrete logarithms. Once this stuff is covered you should be able...

Continue Reading →

Number theory is an integral part of cryptography. It allows us to efficiently introduce a great deal of computational complexity into cryptosystems and is a really interesting subject to study. In this part, I cover prime numbers, modular arithmetic...

Continue Reading →