This series explores the math behind modern secret codes, the kind that protect bank cards and messages online. You will learn about prime numbers, how to test whether a number is prime, and how computers measure the speed of an algorithm. It builds up to RSA encryption and the Diffie-Hellman key exchange, which are used to keep the internet secure. No coding is needed, though comfort with algebra and exponents will help.
Note: All Khan Academy content is available for free at www.khanacademy.org