In this math video lesson, viewers will learn about cryptography and its connection to number theory. The lesson starts with an introduction to Euclid's algorithm and greatest common divisors, and goes on to discuss the basics of number theory, including arithmetic modulo other numbers. The main focus of the lesson is on Fermat's Little Theorem, a theorem in number theory that is essential to public key cryptography systems. The lesson also briefly touches upon the history of cryptography and how it has evolved to become virtually unbreakable.
Learn about cryptography, an application of Discrete Math and combinatorics.
More information about this course:
http://www.aduni.org/courses/discrete
Licensed under Creative Commons Attribution ShareAlike 2.0:
http://creativecommons.org/licenses/by-sa/2.0/