Meeting Your Hero

Imagine if you were a physicist, and you had the opportunity to speak to Isaac Newton, or, as a mathematician to speak, to Carl Friedrich…

Meeting Your Hero

Imagine if you were a physicist, and you had the opportunity to speak to Isaac Newton, or, as a mathematician to speak, to Carl Friedrich Gauss? This week, it will happen for me, as Whitfield Diffie is coming along to speak to our students and guests.

And, so, I have never been so nervous in speaking to someone … even Queen Elizabeth II … than with the Father of Cryptography … Whitfield Diffie. For this, on Tuesday, I have the chance to speak to him:

https://edinburgh-napier.eventcube.io/events/55241/world-leaders-in-cryptography-whitfield-diffie-online/

Basically, if you’re a physicist, there’s a good chance that Brian Cox was the person that goes you into your area. For me, I do what I do because of Whitfield Diffie and Marty Hellman. I have read their paper so many times, and I just love how it secured our world. The work at Stanford (Hellman and Diffie) and MIT (Rivest, Shamir and Adleman) in the 1980s, too, has motivated me in my research and created our foundation of cybersecurity.

The Father of Cryptography

Whitfield (Whit) was first exposed to cryptography at the age of 10 (5th Grade) when a teacher gave a talk for a day and a half. He got serious into cryptography through the development of DES (Data Encryption Standard), and Whit thought that the standard should have more bits to make it more secure.

In the early 1970s, Larry Roberts — the creator of the Internet — started and investment in the security for ARPANET. This started a major drive into finding methods that could protect the data that travelled over the public network. Larry was a great believer in investing in academic work, and this kick started a drive toward network security — mainly focused on cryptography at the time.

Though his interested in the DES method, Whit took a trip in 1974 to the IBM Yorktown Research Lab, and hoped to meet the creator of the DES method: Horst Feistel. Unfortunately, Horst was not around at the time of the visit, but he was told that Marty Hellman at Stanford would be an interesting person for him to chat with.

Whit then set up a short meeting Marty at Stanford (in fact, just 30 minutes) and where they discovered that they had shared interests. In fact, they got on so well that Marty invited Whit and Marty (his wife) to dinner that evening. And, so, Whit arrived at Stanford, and started to investigate the encryption key distribution problem. In four years, Whit and Marty discovered public key encryption.

Whit was initially motivated at the IFF (Identification, Friend or Foe) radar system [here], and where a plane could challenge another plane to identify itself by re-encrypting an encrypted message. The problem with this is that an enemy plane could simply play back the message and produce a valid encrypted message. The work has further led to the IFF Mark XII method.

For this, he understood that a weaknesses of digital systems would be the opportunity to copy digital signals (as with the IFF system). He thus spotted that you could perhaps recognize the solution to a problem without actually being able to solve it yourself. This could then be applied to negotiate keys with someone that you have never met before. And, so, the discrete log method of exchanging keys was born.

Around 1978, it is thought that a chat David Chaum, motivated him into the creation of cryptocurrency.

A great shinning light in his world was his wife, Mary (Fisher), and who’s charm helped support Whit throughout his career.

The Diffie-Hellman method

The Diffie-Hellman (DH) method is perhaps one of the greatest inventions in Cybersecurity and was created by Whitfield Diffie and Marty Hellman:

With the DH method, Bob creates a random value (b) and Alice also creates a random value (a). Next, Bob computes:

B=g^b (mod p)

and sends it to Alice. Alice computes:

A=g^a (mod p)

and sends this to Bob. Bob raises the value of A to the power of b and takes (modp), and Alice raises B to the power of a and takes (mod p). In the end, they will have the same shared value:

g^{ab} (mod p)

This can then be used to derive an encryption key that they can use for a secure tunnel (Figure 1). Overall, p is the large prime number, and also known as the shared modulus between Bob and Alice.

Figure 1: The Diffie Hellman key exchange method [here]

Conclusions

I’m quaking in my boots!