Modern Cryptography Fundamentals

Overview

Curriculum

+
Introduction
1.1 - Course overview
+
What is Cryptography?
2.1 - The Beale ciphers
2.2 - Modern cryptography
2.3 - Open communications
+
Mathematical Foundations of Cryptography 1
3.1 - Random variables
3.2 - The modulo operation
3.3 - The XOR operation
3.4 - Pseudorandomness
+
Mathematical Foundations of Cryptography 2
4.1 - What is number theory?
4.2 - Groups
4.3 - Cyclic groups
4.4 - Fields
4.5 - Abstract algebra in practice
+
Symmetric Cryptography
5.1 - Alice and Bob
5.2 - Symmetric encryption schemes
5.3 - An example: The shift cipher
5.4 - Brute force attacks and Kerckhoff's principle
5.5 - Stream ciphers
5.6 - Block ciphers
5.7 - Clearing up the confusion
5.8 - Message authentication codes
5.9 - Authenticated encryption
5.10 - Secure communication sessions
+
RC4 and AES
6.1 - The RC4 stream cipher
6.2 - AES with a 128-bit key
+
Asymmetric Cryptography
7.1 - The key distribution and management problem
7.2 - New directions in cryptography
7.3 - Asymmetric encryption and authentication
7.4 - Hash functions
+
The RSA cryptosystem
8.1 - The factoring problem
8.2 - Number theoretic results
8.3 - The RSA cryptosystem
+
Final Section
9.1 - Reviews & Ratings
9.2 - Final Exam
9.3 - Conclusion