Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
wbsun
on March 2, 2016
|
parent
|
context
|
favorite
| on:
Diffie and Hellman Win Turing Award
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.
AstralStorm
on March 2, 2016
[–]
This skips the most important part of the proof which explains why this is not easily invertible without the secret key.
lkowalcz
on March 2, 2016
|
parent
[–]
What is this part? Isn't it just by assumption? (also, by secret key, I'm guessing you mean 'a', 'b')
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
((g^a) mod p)^b mod p = (g^ab) mod p = ((g^b) mod p)^a mod p
-- The beauty of math.