January 15, 2002
Practical Aspects of Modern Cryptography
Diffie-Hellman
•
•
Z=Y
X
mod N
•
When
X
is unknown, the problem is
known as the
discrete logarithm
and is
generally believed to be hard to solve.
