Hi all! I still want to finish the assignment from Week 1.
I’ll use this plain-english description of Diffie-Hellman from https://security.stackexchange.com/questions/45963/diffie-hellman-key-exchange-in-plain-english:
- I come up with two prime numbers g and p and tell you what they are.
g = 503 and
p = 98764321261 for some reason.
- You then pick a secret number ( a ), but you don’t tell anyone. Instead you compute g^a mod p and send that result back to me. (We’ll call that A since it came from a ).
Here’s where you compute and share a value for
A ! Please reply to this post with your value for
- I do the same thing, but we’ll call my secret number b and the computed number B . So I compute g^b mod p and send you the result (called " B ")
B = (g ^ b) % p = 46659981003
- Now, you take the number I sent you and do the exact same operation with it. So that’s B^a mod p .
And that’s how you get our shared secret. Note that it’s lower case
a, your secret value.
- I do the same operation with the result you sent me, so: A^b mod p .
And that’s how I get our shared secret.
Awesome! Let’s do it. Online. Right now.