Claude Shannon's idea of perfect secrecy: no amount of computational power can help improve your ability to break the one-time pad. Created by Brit Cruise.
Brit introduces the polyalphabetic cipher, which creates a lighter fingerprint than the Caesar cipher. Created by Brit Cruise.
How can a machine tell us if a number is prime? Created by Brit Cruise.
An attempt at an optimal trial division primality test using the Sieve of Eratosthenes. Created by Brit Cruise.
This course is an introduction to discrete applied mathematics. Topics include probability, counting, linear programming, number-theoretic algorithms, sorting, data compression, and error-correcting codes. This is a Communication Intensive in the Major (CI-M) course, and thus includes a writing component.
Random vs. Pseudorandom Number Generators. Created by Brit Cruise.
Why do we need public key cryptography? Created by Brit Cruise.
This course provides an introduction to the theory and practice of quantum computation. Topics covered include: physics of information processing, quantum logic, quantum algorithms including Shor’s factoring algorithm and Grover’s search algorithm, quantum error correction, quantum communication, and cryptography.
Introduction to why we would need RSA. Created by Brit Cruise.
Setting up a trapdoor one-way function. Created by Brit Cruise.
RSA Encryption (step 3). Created by Brit Cruise.
RSA worked example. Created by Brit Cruise.
How could random numbers speed up a decision algorithm? Created by Brit Cruise.
Introduction to random primality tests & how they will work (warm up). Created by Brit Cruise.
This course covers a number of advanced “selected topics” in the field of cryptography. The first part of the course tackles the foundational question of how to define security of cryptographic protocols in a way that is appropriate for modern computer networks, and how to construct protocols that satisfy these security definitions. For this purpose, the framework of “universally composable security” is studied and used. The second part of the course concentrates on the many challenges involved in building secure electronic voting systems, from both theoretical and practical points of view. In the third part, an introduction to cryptographic constructions based on bilinear pairings is given.
Sieve of Eratosthenes allows us to generate a list of primes. Created by Brit Cruise.
Why is factorization hard, yet generating primes easy? Where do we go from here? Created by Brit Cruise.
what is our memory limit? How can save time at the expense of space? Created by Brit Cruise.
What is the limit of computer memory? Created by Brit Cruise.
What is Cryptography? A story which takes us from Caesar to Claude Shannon. Created by Brit Cruise.