Social Sciences, asked by ashujaguar2249, 1 year ago

The security of the Diffie-Hellman key exchange lies in
(1) While it is relatively easy to calculate exponentials modulo a prime, it is very difficult to calculate discrete logarithms.
(2) While it is difficult to calculate exponentials modulo a prime, it is easy to calculate discrete logarithms.
(3) It’s diflicult to calculate exponentials modulo a prime and discrete logarithms.
(4) Exchange algorithm is secret and not known to attacker.

Answers

Answered by Anonymous
0

Explanation:

 \huge \bold{hlo \: mate} \\  \\  \ =  =  =  =  =  =  =  =  =  =  =  =  \\  \huge \bold \red{answer =  > } \\  =  =  =  =  =  =  =  =  =  =  =  =   \\   \\  \huge \bold \green{option \:  =  > 1} \\  =  =  =  =  =  =  =  =  =  =  =  = \\  \\  \huge{hope \: it \: helps}

Answered by Anonymous
0

Hey Mate!

✓✓ Your Answer ✓✓

################

Good Question

**********************

Option : 1)

_____________________

The security of the Diffie-Hellman key exchange lies in

(1) While it is relatively easy to calculate exponentials modulo a prime, it is very difficult to calculate discrete logarithms.

.........

Similar questions