4/2: Dan Nichols, “Public-key cryptography and the discrete logarithm problem”

Abstract:

The problem of finding a discrete logarithm in a finite group is the basis for some widely-used cryptographic systems including Diffie-Helman key exchange (DHKE) and elliptic curve cryptography (ECC). You may not be familiar with these encryption methods, but you use them every day when you visit a secure webpage or send a message from your smartphone. I will describe this problem and explain how it is used for secure communication and authentication in web browsers, electronic devices, and more.