Media Summary: This is a short lecture about finding primitive roots mod p when (p-1)/2 is prime. We also look at another How do we exchange a secret key in the clear? Spoiler: We don't - Dr Mike Pound shows us exactly what happens. Mathematics ... How can two computers share a piece of secret information without anyone else knowing?
More Diffie Hellman The Man - Detailed Analysis & Overview
This is a short lecture about finding primitive roots mod p when (p-1)/2 is prime. We also look at another How do we exchange a secret key in the clear? Spoiler: We don't - Dr Mike Pound shows us exactly what happens. Mathematics ... How can two computers share a piece of secret information without anyone else knowing? Correction : as oodles of commenters have pointed out, the clock face should go from 0 to n-1. Also, worth reminding people that ... The history behind public key cryptography & the Viewers like you help make PBS (Thank you ) . Support your local PBS Member Station here:
