WARNING:
JavaScript is turned OFF. None of the links on this concept map will
work until it is reactivated.
If you need help turning JavaScript On, click here.
Este Cmap, tiene información relacionada con: Diffie-Hellman-A, easy operation because efficient algorithms exist to solve this problem, one way function use Zp* group, one way function use inverse of exponentiation, Zp* group with p prime, inverse of exponentiation is hard, p prime with p ≥ 2048 bits long, one way function use exponentiation, efficient algorithms exist to solve this problem if p ≥ 2048 bits long, one way function use modular arithmetic, one way function use finite field theory, hard in Zp* group, Discrete logarithm problem in Zp* is one way function, Diffie Hellman key exchange protocol is based on Discrete logarithm problem in Zp*, hard because no efficient algorithms exist to solve this problem, easy operation like x= g^b mod p, exponentiation is the easy operation