Scribd
Upload
32 views

03 03 DiffieHellman

This document outlines the Diffie-Hellman key exchange protocol. It shows Alice and Bob generating random secret integers a and b respectively. They then compute public values Av=g^a and Bv=g^b. Alice computes the shared secret Sa=B^a and Bob computes Sb=A^b. Both arrive at the same shared secret which can be used to securely exchange messages.

Uploaded by

mihreteab ghebregzabher
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
32 views

03 03 DiffieHellman

This document outlines the Diffie-Hellman key exchange protocol. It shows Alice and Bob generating random secret integers a and b respectively. They then compute public values Av=g^a and Bv=g^b. Alice computes the shared secret Sa=B^a and Bob computes Sb=A^b. Both arrive at the same shared secret which can be used to securely exchange messages.

Uploaded by

mihreteab ghebregzabher
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Non-Secret Values

P 17 Prime Number
Base - a Prime Number Smaller
g 5
than P

Alice Av 3125 "=(g^a)"


Bob Bv 625 "=(g^b)"

Alice computes 371293 Sa=B^a"


Bob computes 38416 Sb=A^b"
Secret Values
Alice's random secret integer. Must
a 5
be smaller than P
Bob's random secret integer. Must be
b 4
smaller than P

14 A=MOD(Av,P) Alice sends this to Bob


13 B=MOD(Bv,P) Bob sends this to Alice

13 Shared secret =MOD(Sa,P)"


13 Shared secret =MOD(Sb,P)
Non-Secret Values
P Prime Number
Base - a Prime Number Smaller
g
than P

Mine Av 1 "=(g^a)"
Friend Bv 1 "=(g^b)"

I compute #VALUE! Sa=B^a"


Friend computes #VALUE! Sb=A^b"
Secret Values
My random secret integer. Must be
a
smaller than P
Friend's random secret integer. Must
b
be smaller than P

### A=MOD(Av,P) I send this to my friend


### B=MOD(Bv,P) My friend sends this to me

#VALUE! Shared secret =MOD(Sa,P)"


#VALUE! Shared secret =MOD(Sb,P)

You might also like