Diffie-Hellman Key Exchange and Forward Secrecy
Diffie-Hellman is the most secure way of doing a Key Exchange. Specifically because it provides a very important Cryptographic concept known as Forward Secrecy. In this video we show you Diffie-Hellman twice: once with simplified math, and later with the real math. Then we define Forward Secrecy, and explain how Diffie-Hellman provides it. // CHAPTERS 00:00 - Intro / Key Exchange review 00:36 - Plan for this video 01:19 - Simplified Diffie-Hellman Key Exchange 03:29 - Diffie-Hellman Assurances 04:13 - Forward Secrecy 06:59 - Modular Exponentiation 08:47 - Real Diffie-Hellman Math 12:00 - Outro // FULL SERIES - Cryptography Essentials // This video is part of a 16-part series covering the essentials of modern Cryptography. Explained simply, and technically accurate. The full series is available here: 📋    • Cryptography Essentials  ( or use the shortcut pracnet.net/ce ) 00  Series Introduction 01  Hashing 02  Keys / Secret Keys 03  Symmetric Cryptography 04  Encryption 05  MAC / HMAC 06  Pseudo Random Function 07  Asymmetric Cryptography 08  Asymmetric Encryption (RSA) 09  Signatures 10  RSA Signatures 11  DSA Signatures 12  Key Exchanges 13  RSA Key Exchanges 14  DH Key Exchanges 15  Elliptic Curve Cryptography // ADDITIONAL RESOURCES // Diffie-Hellman Key Exchange -- full lesson:    • Diffie-Hellman Key Exchange - the MAGIC th...  Practical TLS - free lessons:    • Practical TLS - Free Lessons from my SSL D...  Practical TLS - full course: https://pracnet.net/tls // SUPPORT PRACTICAL NETWORKING // If this content benefited you, then here are TOTALLY FREE ways to show your appreciation: 👍 Like to help this video reach more viewers 💬 Comment to boost the channel's visibility 🔔 Subscribe to help me attract sponsors (this is the number they care about)

Elliptic Curve Cryptography in less than 5 minutes

Diffie-Hellman Key Exchange: How to Share a Secret

Key Exchange Problems - Computerphile

PRFs explained: Transforming Secrets into Infinite Keys - Pseudo Random Functions

Secret Key Exchange (Diffie-Hellman) - Computerphile

What Nobody Tells You About Being a Quant

Hashing and Hashing Algorithms - md5 sha1 sha256 sha2 sha3 - Cryptography Essentials

Perfect Forward Secrecy

We're 99.9% sure this pattern is true, but no one can prove it

Diffie-Hellman Key Exchange - the MAGIC that makes it possible - Cryptography - Practical TLS

Elliptic Curves - Computerphile

Psychology of People With Extremely High IQ

Reinventing Entropy | Compression is Intelligence Part 1

Understanding Secret Keys: A Simple Explanation

The Strange Math That Predicts (Almost) Anything

Perfect Forward Secrecy in TLS Explained

Martijn Grooten - Elliptic Curve Cryptography for those who are afraid of maths

Diffie Hellman -the Mathematics bit- Computerphile

