X-Nico

unusual facts about Diffie–Hellman problem


Diffie–Hellman problem

The Diffie–Hellman problem (DHP) is a mathematical problem first proposed by Whitfield Diffie and Martin Hellman in the context of cryptography.


CyaSSL

CTaoCrypt Provides RSA, DSS, Diffie–Hellman, EDH, NTRU, DES, Triple DES, AES (CBC, CTR, CCM, GCM), Camellia, ARC4, HC-128, MD2, MD4, MD5, SHA-1, SHA-2, BLAKE2, RIPEMD-160, Random Number Generation, Large Integer support, and base 16/64 encoding/decoding.

James H. Ellis

When, a few years later, Diffie and Hellman published their 1976 paper, and shortly after that Rivest, Shamir, and Adleman announced their algorithm, Cocks, Ellis, and Williamson suggested that GCHQ announce that they had previously developed both.

National Cyber Security Hall of Fame

Ralph Merkle - Developed earliest public key cryptography system with Diffie and Hellman

Scrambler

It was the need to synchronize the scramblers that suggested to James H. Ellis the idea for non-secret encryption which ultimately led to the invention of both the RSA encryption algorithm and Diffie-Hellman key exchange well before either was reinvented publicly by Rivest, Shamir, and Adleman, or by Diffie and Hellman.

Spycatcher

After the re-discovery and commercial use of PKI by Rivest, Shamir, Diffie and others, the British government considered releasing the records of GCHQ's successes in this field.

XKMS

While this approach was originally suggested by Diffie and Hellman in their New Directions paper this was generally considered impractical at the time leading to commercial development focusing on the certificate based approach proposed by Loren Kohnfelder.


see also