Login
Remember
Register
Ask a Question
The Diffie-Hellman algorithm exploits the computational complexity of the __________ problem.
+1
vote
asked
Oct 21, 2020
in
The Art of Cryptography
by
rahuljain1
The Diffie-Hellman algorithm exploits the computational complexity of the __________ problem.
(a) Integer factorization
(b) Exponential logarithm
(c) Discrete logarithm
#diffie-hellman-algorithm
Please
log in
or
register
to answer this question.
0
Answers
...
