The Gateway to Computer Science Excellence
0 votes
215 views
The Diffie-Hellman key exchange is being used to establish a secret key between
Alice and Bob. Alice sends Bob (227, 5, 82). Bob responds with (125). Alice’s
secret number, x, is 12, and Bob’s secret number, y, is 3. Show how Alice and Bob
compute the secret key.
in Computer Networks by | 215 views
0
Is it there in GATE syllabus?
+1
Yes that is....!!!
0
ok thank you

1 Answer

+1 vote
Public keys=227, 5

A's secret key=12, B's secret key=3

A generates key=$5^{12}$ MOD 227=82. This key is sent to B

Similarly B's key is obtained by $5^3$ MOD 227=125. This key is sent to A

A receives 125 and B receives 82. This will be used by A and B to compute the secret key for encryption

A computes secret key $K_{A}=125^{12}$ MOD 227

B computes secret key $K_{B}=82^{3}$ MOD 227

$K_{A}$ and $K_{B}$ will be same
by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,315 questions
60,429 answers
201,762 comments
95,240 users