Introduction to Cryptography
1:17:24Modular Arithmetic and Historical Ciphers
1:31:10Stream Ciphers, Random Numbers and the One Time Pad
1:29:38Stream Ciphers and Linear Feedback Shift Registers
1:29:39Data Encryption Standard (DES): Encryption
1:33:36Data Encryption Standard (DES): Key Schedule and Decryption
1:07:06Introduction to Galois Fields for the AES
1:30:50Advanced Encryption Standard (AES)
1:33:19Modes of Operation for Block Ciphers
1:25:14Multiple Encryption and Brute-Force Attacks
1:27:49Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
1:31:02The RSA Cryptosystem and Efficient Exponentiation
1:28:27Diffie-Hellman Key Exchange and the Discrete Log Problem
1:20:47The Generalized Discrete Log Problem and the Security of Diffie-Hellman
1:28:40Elgamal Encryption Scheme
1:17:51Introduction to Elliptic Curves
1:20:42Elliptic Curve Cryptography (ECC)
1:26:31Digital Signatures and Security Services
1:17:15Elgamal Digital Signature
1:22:23Hash Functions
1:05:04SHA-1 Hash Function
1:18:35SHA-3 Hash Function
1:38:17Modular Arithmetic and Historical Ciphers
Founding Director, Max Planck Institute for Security and Privacy
This lecture introduces the foundational principles of modular arithmetic, essential for modern cryptography, and applies these concepts to analyze the mechanics and cryptanalysis of classical substitution ciphers such as the Caesar and Vigenère ciphers.
Interested in studying cybersecurity at the highest level? Bochum offers one of the most advanced academic environments for cybersecurity in Europe. The Max Planck Institute for Security and Privacy (MPI-SP) collaborates closely with the Horst Görtz Institute (HGI) at Ruhr University Bochum (RUB), where leading experts from across the field contribute through excellent teaching and pioneering research. Find out more at
Introduction to Cryptography
Next · Lecture 3Stream Ciphers, Random Numbers and the One Time Pad