Cryptography Full Course Part 2

💠💠ABOUT THIS COURSE:💠💠 Cryptography is an indispensable tool for protecting information in computer systems. In this course you will learn the inner workings of cryptographic systems and how to correctly use them in real-world applications. The course begins with a detailed discussion of how two parties who have a shared secret key can communicate securely when a powerful adversary eavesdrops and tampers with traffic. We will examine many deployed protocols and analyze mistakes in existing systems. The second half of the course discusses public-key techniques that let two parties generate a shared secret key. Throughout the course participants will be exposed to many exciting open problems in the field and work on fun (optional) programming projects. In a second course (Crypto II) we will cover more advanced cryptographic tasks such as zero-knowledge, privacy mechanisms, and other forms of encryption Course material ▶▶ https://drive.google.com/file/d/15PLEq4Q1l57DOqE4nHe3MIF8R1ReHPJ4/view?usp=sharing Recommended Reading ▶▶The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography https://amzn.to/3vz1Rza ▶▶The Code Breaker https://amzn.to/3e7ua1N ⭐⭐⭐⭐🕑TIME STAMP📋⭐⭐⭐⭐⭐ 👉COLLISION RESISTANCE 0:06:21 The Merkle-Damgard Paradigm 0:17:54 Construction Compression functions 0:26:03 HMAC 0:33:07 Timing attacks on Mac Verification 👉AUTHENTICATED ENCRYPTION 0:41:36 Active attacks on CPA-secure encryption 0:54:30 Definitions 0:59:44 Chosen ciphertext Attacks 1:11:49 Constructions from ciphers and MACs 1:32:07 Case Study 1:49:46 CBC padding attacks 2:03:52 Attacking non-atomic decryption 👉ODDS AND ENDS 2:13:42 Key Derivation 2:27:17 Deterministi Encryption 2:41:50 Deterministic Encryption-SIV and wide PRP 3:02:19 Tweakable encryption 3:16:44 Format Preserving encryption 👉BASIC KEY EXCHANGE 3:28:58 Trusted 3rd Parties 3:40:10 Merkle Puzzles 3:51:28 The Diffie-Hellman Protocol 4:10:29 Public-key encryption 👉INTRODUCTION TO NUMBER THEORY 4:21:25 Notation 4:35:41 Fermat and Euler 4:53:46 Modular e-'th roots 5:10:54 Arithmetic algorithms 5:23:29 Intractable problems 👉PUBLIC KEY ENCRYPTION FROM TRAPDOOR PERMUTATIONS 5:42:09 Definitions and Security 5:57:49 Constructions 6:08:14 The RSA trapdoor permutations 6:25:48 PKCS1 6:46:56 Is RSA a one-way function 7:03:31 RSA in practice 👉PUBLIC KEY ENCRYPTION FROM DIFFIE-HELLMAN 7:17:26 The ElGamal Public-key System 7:36:55 ElGamal Security 7:50:07 ElGamal Variants with Better Security 8:00:28 A Unifying Theme 8:12:12 Farewell (for now) #cryptographylectures ------------------------------------------------------------------------------------------------------------------------------------- If you realllly enjoy my content, you're welcome to support me and my channel with a small donation via PayPal ⌨️ This course is created in collaboration with Stanford University. 👉Link to PayPal donation https://www.paypal.me/nerdslesson ♥️♥️Thanks for watching don't forget to like and Subscribe♥️♥️