diffieHellman

Captcha style question is asked


How to implement Diffie Hellman in a chat program. from the Wikipedia article on Diffie Hellman they say Alice and Bob agree? how do they agree securely? see image above can you see 23 and 5 :)

  1. Alice and Bob agree to use a prime number p = 23 and base g = (which is a primitive root modulo 23).  ....( editor me inserted here um how do they agree see the captcha picture above ... for example find the pair of largest sized numbers in the image .......  basically what you need to see in this section is that 2 numbers need to be transferred 5 and 23 )
  2. Alice chooses a secret integer a = 6, then sends Bob A = ga mod p
    • A = 56 mod 23 = 8
  3. Bob chooses a secret integer b = 15, then sends Alice B = gb mod p
    • B = 515 mod 23 = 19
  4. Alice computes s = Ba mod p
    • s = 196 mod 23 = 2
  5. Bob computes s = Ab mod p
    • s = 815 mod 23 = 2
  6. Alice and Bob now share a secret (the number here is 2 in real life something like a key 237749292734233872034823820337573693530247724923949242472304023784273092024375759593202304221902373903804028220230940238429034092340230840823402840939409234098828773243204320324237703282300423907231023).

  7. Page 2 and help at private facebook group Freeworldnetwork hmm using it to create a chat program on page 2 here
  8. back to my main page here

ċ
10000.txt
(71k)
Stephen P,
3 Dec 2014, 11:00
Comments