Diffie–Hellmann.

Brit.

/ˌdɪfɪˈhɛlmən/, U.S.

/ˌdɪfiˈhɛlmən/

Origin: From proper names. Etymons: proper name Diffie, proper name Hellman.

Etymology: < the names of Whitfield Diffie (b. 1944) and Martin Edward Hellman (b. 1945), U.S. cryptographers, who devised the protocol in 1976 (W. Diffie & M. E. Hellman IEEE Trans. Information Theory 22 644).M. J. Williamson, a British mathematician, described an equivalent system in 1974, but in a classified document that was not published until 1998 (compare RSA n.²).

Cryptography.

I. Compounds.

1. attributive. Designating a protocol that allows two people to create a shared private key without the key being transmitted; employing or based on this protocol. Cf. private key n., public key n.

ΚΠ

1979 L. Adleman in 20th Ann. Symp. Found. Computer Sci. 55 The security of the Diffie-Hellman Public Key Distribution System ‘depends crucially on the difficulty of computing logarithms MOD q’.

1995 Sci. Amer. Dec. 71/2 To exchange a key with Bob according to the Diffie-Hellman protocol, Alice takes a publicly known number, applies her one-way function..—and sends the result via public channels to Bob.

2002 S. Oaks Java Security x. 237 The SunJCE security provider implements one key agreement algorithm: Diffie-Hellman key agreement.

2010 Windows IT Pro Mag. (Nexis) 1 Jan. 39 The two computers establish a secure, authenticated channel by going through policy negotiation, a Diffie-Hellman exchange, and authentication.

II. Simple uses.

2. A protocol that allows two people to create a shared private key without the key being transmitted.

ΚΠ

1987 IEEE Trans. Software Engin. 13 290/2 If we cannot find discrete logarithms, then we cannot break Diffie-Hellman.

1998 J. Knudsen Java Cryptogr. v. 60 The examples presented here demonstrate how to use Diffie-Hellman to agree on a secret value.

2008 A. C. Clarke & F. Pohl Last Theorem xxii. 150 Diffie-Hellman was based on a very simple idea, but one that had been so difficult to execute that the idea had been useless until the age of really powerful computers.

This is a new entry (OED Third Edition, June 2016; most recently modified version published online March 2022).

单词	diffie–hellman
释义	Diffie–Hellmann. Brit. /ˌdɪfɪˈhɛlmən/, U.S. /ˌdɪfiˈhɛlmən/ Origin: From proper names. Etymons: proper name Diffie, proper name Hellman. Etymology: < the names of Whitfield Diffie (b. 1944) and Martin Edward Hellman (b. 1945), U.S. cryptographers, who devised the protocol in 1976 (W. Diffie & M. E. Hellman IEEE Trans. Information Theory 22 644).M. J. Williamson, a British mathematician, described an equivalent system in 1974, but in a classified document that was not published until 1998 (compare RSA n.²). Cryptography. I. Compounds. 1. attributive. Designating a protocol that allows two people to create a shared private key without the key being transmitted; employing or based on this protocol. Cf. private key n., public key n. ΚΠ 1979 L. Adleman in 20th Ann. Symp. Found. Computer Sci. 55 The security of the Diffie-Hellman Public Key Distribution System ‘depends crucially on the difficulty of computing logarithms MOD q’. 1995 Sci. Amer. Dec. 71/2 To exchange a key with Bob according to the Diffie-Hellman protocol, Alice takes a publicly known number, applies her one-way function..—and sends the result via public channels to Bob. 2002 S. Oaks Java Security x. 237 The SunJCE security provider implements one key agreement algorithm: Diffie-Hellman key agreement. 2010 Windows IT Pro Mag. (Nexis) 1 Jan. 39 The two computers establish a secure, authenticated channel by going through policy negotiation, a Diffie-Hellman exchange, and authentication. II. Simple uses. 2. A protocol that allows two people to create a shared private key without the key being transmitted. ΚΠ 1987 IEEE Trans. Software Engin. 13 290/2 If we cannot find discrete logarithms, then we cannot break Diffie-Hellman. 1998 J. Knudsen Java Cryptogr. v. 60 The examples presented here demonstrate how to use Diffie-Hellman to agree on a secret value. 2008 A. C. Clarke & F. Pohl Last Theorem xxii. 150 Diffie-Hellman was based on a very simple idea, but one that had been so difficult to execute that the idea had been useless until the age of really powerful computers. This is a new entry (OED Third Edition, June 2016; most recently modified version published online March 2022). < n.1979
随便看	θ19376 θ193760 θ193761 θ193762 θ193763 θ193764 θ193765 θ193766 θ193767 θ193768 θ193769 θ19377 θ193770 θ193771 θ193772 θ193773 θ193774 θ193775 θ193776 θ193777 θ193778 θ193779 θ19378 θ193780 θ193781