Cryptanalysis - Caesar Cipher

22 Jan 2015

How do we make sure the messages we send are only read by the intended recipient? This problem has been bothering people for a long time, with examples of encryption being used to hide messages going back to ancient Egypt, some 4000 years ago. I will...

Continue Reading →

Number Theory Part 2

17 Nov 2014

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 - Part 1

05 Oct 2014

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 →