Diffie-Hellman

• Based on the difficulty of computing discrete logarithms of large numbers.

• No known successful attack strategies.

• Invented by Whitfield Diffie and Hellman 1976.

• Needs 2 large numbers, one prime(P), one (Q) a primitive root of P.

Previous slide

Next slide

Back to first slide

View graphic version