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: D-H-alumn5, A ≡ α^a (mod p) is exchange the calculated number, easy operation is k= (α^b)^a mod p, public parameter like a generator α of a cyclic group Zp*, A ≡ α^a (mod p) in Zp* group, Public exchange of values is the easy operation, Further private computation like k= (α^b)^a mod p, easy operation they exchange the calculated number, Discrete logarithm problem use Further private computation, private computations like choose a secret number, Diffie Hellman key exchange protocol is based on Discrete logarithm problem, Discrete logarithm problem use private computations, public parameter like large prime p, choose a secret number to compute A ≡ α^a (mod p), Discrete logarithm problem use Public exchange of values, Discrete logarithm problem use public parameter