News for hackers. Stuff that matters.

A comment on Diffie and Hellman Win Turing Award.

Re:Diffie and Hellman Win Turing Award by wbsun on Wednesday March 02, 2016 @12:41AM (#11208297)
tl;dr version of the 2016 ACM Turing Award:

((g^a) mod p)^b mod p = (g^ab) mod p = ((g^b) mod p)^a mod p

-- The beauty of math.

[ Parent | on HN ]
Re:Diffie and Hellman Win Turing Award by AstralStorm on Wednesday March 02, 2016 @01:38AM (#11208441)
This skips the most important part of the proof which explains why this is not easily invertible without the secret key.
[ Parent | on HN ]
Re:Diffie and Hellman Win Turing Award by lkowalcz on Wednesday March 02, 2016 @10:22AM (#11210448)
What is this part? Isn't it just by assumption? (also, by secret key, I'm guessing you mean 'a', 'b')
[ Parent | on HN ]