1,453 views

1 Answer

Best answer
3 3 votes

Given that g is the primitive root and n is the modulus. Party A(sender) secret key be $K_{a}$ and let party B(receiver) secret key be $K_{b}$.

Party A is aware of g,n and $K_{a}$ whereas Party B is aware of g,n and $K_{b}$ . Message sent by A to B will be $M_{ab}$ = $g^{K_{a}}$modn and message sent by party B to A will be $g^{K_{b}}$modn

$M_{ab}$ = 116 mod 23 = 9 

$M_{ba}$ = 115 mod 23 = 5

The DH key for party A will be (Mba)6 mod 23 which is equal to DH key for party B which is, (Mab)5 mod 23.

(Mba)6 mod 23 = (Mab)5 mod 23 = (5)6 mod 23 = (9)5 mod 23 = 8

• selected by
Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
3.0k
3.0k views
Himanshu1 asked Dec 6, 2015
3,028 views
0 0 votes
0 0 answers
2.1k
2.1k views
JustPakYt asked Nov 13, 2022
2,111 views
Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root a=2. If user A as public key YA=9 what is as private key XA? If user B has public key YB= 3...
1 1 vote
1 1 answer
161
161 views
Shubham Sharma 2 asked Apr 19
161 views
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason RAssertion A: Asymmetric key cryptography is significant slower than sy...
0 0 votes
1 1 answer
278
278 views
Shubham Sharma 2 asked Nov 8, 2025
278 views
Which of the following does not use key(s)?Symmetric CiphersGeneration of Message DigestGeneration of Message Authentication CodeKey exchange algorithms