Diffie–Hellman problem

Summary

Diffie–Hellman problem is a computational hardness assumption^[1]. It draws 34 Wikipedia views per month (computational_hardness_assumption category, ranking #3 of 3).^[2]

Key Facts

• Diffie–Hellman problem's instance of is recorded as computational hardness assumption^[3].
• Whitfield Diffie is named after Diffie–Hellman problem^[4].
• Martin Edward Hellman is named after Diffie–Hellman problem^[5].
• Diffie–Hellman problem's Freebase ID is recorded as /m/090f_k^[6].
• Diffie–Hellman problem's Microsoft Academic ID is recorded as 2777570545^[7].

Body

Designation and Status

Diffie–Hellman problem's instance of is recorded as computational hardness assumption^[3].

History and Context

Things named after include Whitfield Diffie^[4], a cryptographer^[8], b. 1944^[9], of United States^[10], awarded the honorary doctor of ETH Zürich^[11], specialised in cryptography^[12] and Martin Edward Hellman^[5], a cryptographer^[13], b. 1945^[14], of United States^[15], awarded the EFF Award^[16], specialised in cryptography^[17].

Why It Matters

Diffie–Hellman problem draws 34 Wikipedia views per month (computational_hardness_assumption category, ranking #3 of 3).^[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.^[18] It is known by 3 alternative names across languages and contexts.^[19]