It's about freakin' time.
Well deserved! Hear, hear.
The Association for Computing Machinery used the RSA 2016 conference to announce the winners of its annual Turing Award: encryption wizards Whitfield Diffie and Martin Hellman. "Naturally I'm thrilled by this by this award, but thrilled for cryptography," Diffie said. "It's the third time the Turing award has been given to …
Cracked is too strong a verb. It has a particular weakness where a lot of the effort that is needed to compute it can be shared across groups of keys. If you have TLA level resources you can precompute the common keys then attack the final stage in a practical timeframe. Use 2048 bit or higher or ECDH and you are safe (as far as we know of course), but it is reasonable to assume that the TLAs can get to things below 1024 bit.
Diffie-Hellman refers to the technique used in PKI infrastructure; you can't really crack Diffie Hellman itself as such. You can crack a 4-bit key version of Diffie-Hellman easily... but having done so you wouldn't have cracked a 1024-bit key version.
A current recognition is very much deserved, since I guarantee that a lot of the technologies involved in allowing you to write the post you just made are using Diffie-Hellman. Including, for example, the web certificate infrastructure that allows your PC to trust any other computer it wants to communicate with.
Biting the hand that feeds IT © 1998–2019