Talk:Diffie–Hellman key exchange
This is the talk page for discussing improvements to the Diffie–Hellman key exchange article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
Archives: 1Auto-archiving period: 90 days ![]() |
![]() | This ![]() It is of interest to the following WikiProjects: | ||||||||||||||||||||||||||||||||||||||||||||||||||
|
|
|
This page has archives. Sections older than 90 days may be automatically archived by Lowercase sigmabot III when more than 5 sections are present. |
'insecure channel' or ?
[edit]The second paragraph states:
The Diffie–Hellman key exchange method allows two parties that have no prior knowledge of each other to jointly establish a shared secret key over an insecure channel
The linked page defines that an "insecure channel" is "unencrypted and may be subject to eavesdropping and tampering". Since DH doesn't protect against MITM, perhaps we should change this to say 'authentic channel', as "an authentic channel is a means of data transmission that is resistant to tampering but not necessarily resistant to overhearing."? --Raboof (talk) 08:25, 17 January 2023 (UTC)
Please, evaluate to choose the values in the numeric example.
[edit]There is a method to choose the values, there aren't random. You must choose a prime p, a q which divides p-1 and a generator of order q. In the example, g is not a order q genereator. You can check it with g^q mod p != 1. 5^11 mod 23 != 1. If you choose q=2, it's a example trivial, I suppose you choose q=11. 23-1=22=2*11 — Preceding unsigned comment added by 193.146.209.194 (talk) 09:36, 23 November 2021 (UTC)
- p-1 = 22, and 5^22 = 1 mod 23. So what's wrong with using q=22? DaemonicSigil (talk) 02:10, 14 October 2022 (UTC)
Salom 84.54.73.215 (talk) 16:56, 29 April 2023 (UTC)
Incorrect image?
[edit]The main image on this article I think might be incorrect? My understanding (from this article even) is that a single public key is agreed upon? The image has Bob and Alice each using their public keys. Can someone correct/corroborate me on this? Epachamo (talk) 21:31, 9 December 2023 (UTC)
- Ok, I changed the image and based it on the example in the text. Epachamo (talk) 14:39, 18 December 2023 (UTC)
Merge proposal
[edit]- The following discussion is closed. Please do not modify it. Subsequent comments should be made in a new section. A summary of the conclusions reached follows.
- To improve both articles rather than tho merge; Post-Quantum Extended Diffie-Hellman is suitable for expansion. Klbrain (talk) 09:42, 11 August 2024 (UTC)
It was proposed over at Talk:Signal Protocol that Post-Quantum Extended Diffie-Hellman might usefully be merge here, for reasons of short text and context. Let's discuss the new proposal here. Klbrain (talk) 14:56, 28 January 2024 (UTC)
- In my opinion as an editor, the Post-Quantum Extended Diffie-Hellman (PQXDH) could be extended a bit more. There is more information to put in that article. I don't think they should be merged. Rather that PQXDH should be expanded. Epachamo (talk) 19:01, 29 January 2024 (UTC)
- There is a large gap between PQXDH and good old DH; just merging might not make enough sense. However, I believe we can make the cognitive gap a lot more navigable by getting a good description of PQXDH's predecessor, X3DH, on the DH page. Artoria2e5 🌉 02:42, 21 February 2024 (UTC)
"Diffie–Hellman key exchange" is a confusing and misleading title/term
[edit]The following discussion is closed. Please do not modify it. Subsequent comments should be made on the appropriate discussion page. No further edits should be made to this discussion.
When I first stumbled across "Diffie–Hellman key exchange", the image elicited in my head was that A and B somehow exchange their secret key. I'm quite sure that the same image is elicited in any other person's head on first encountering the term. I appreciate that this is the term first coined for this particular mathematical method.
Proposal: To possibly remedy this dilemma, I suggest to move the content of the page entitled "Diffie–Hellman key exchange" to a new page entitled "Diffie–Hellman key agreement" The original page could then be replaced with a link to the new page, why the term is preferred, and a short description of how the original naming of the term came about. The new page would then only need minimal changes to its introduction.
The German title/term "Diffie-Hellman-Schlüsselaustausch" suffers from the same problem and a corresponding change should be done with the German Wikipedia pages: "Diffie-Hellman-Schlüsselaustausch" → "Diffie-Hellman-Schlüsselvereinbarung".
I would be willing to propose the exact changes necessary if there is agreement to follow above proposal. AliBabbaD (talk) 15:20, 1 September 2024 (UTC)
- Diffie-Hellman key agreement is an established term in the literature, though Diffie-Hellman key exchange is more common. The Wikipedia approach would be to list both terms in the introduction and to use a redirect, which points to the same page (Diffie-Hellman key agreement is already a redirect). An explanation of why a term is to be preferred is a violation of WP:NPOV, unless it is a description of a notable expert opinion with citation. --Matthäus Wander (talk) 16:00, 1 September 2024 (UTC)
- One expert's, or ten experts', preference wouldn't equate to "is preferred". If the "exchange" version is more common, that implies the net preference among those referring to the technology. It would be another thing to say the "exchange" version is less accurate. Largoplazo (talk) 17:42, 1 September 2024 (UTC)
- I understand your point about "is preferred". I would then say "... could then be replaced with a link to the new page, why the term is more meaningful, and a short description of how the original naming of the term came about" (Diffie-Hellman key agreement would obviously cease to be a redirect). AliBabbaD (talk) 20:59, 1 September 2024 (UTC)
- Well, maybe. When there's a choice to make, an article's title is chosen based on the WP:COMMONNAME guidelines. Ordinarily, that's the most used term. If "... exchange" is the predominating usage, then the article is already at the prescribed title unless there's a consensus that there's another term, also in common use, that causes fewer problems for the reader. Largoplazo (talk) 21:31, 1 September 2024 (UTC)
- "Diffie–Hellman exchange for key agreement" may better express the method in question but would not be a commonly recognisable name for the article.Diffie-Hellman key agreement expresses the method nearly as well given that an exchange usually precedes an agreement.
- Diffie-Hellman key exchange, however, would evoke the image that A and B somehow exchange their secret keys in any reader's head that is not yet familiar with the subject. Just imagine yourself to be a reader who is not yet familiar with the subject; Would you, on encountering Diffie-Hellman key exchange, not think that A and B somehow exchange their secret keys?
- I hope this reasoning suffices to bring about a consensus. AliBabbaD (talk) 11:27, 2 September 2024 (UTC)
- Witness the following dialog with ChatGPT …
- I: Who gave the method "Diffie-Hellman key exchange" its name and when did this happen?
- ChatGPT: The "Diffie-Hellman key exchange" method was named after its inventors, Whitfield Diffie and Martin Hellman. They introduced the method in their seminal paper titled "New Directions in Cryptography," which was published in November 1976.
- The naming likely occurred as the method became widely recognized in the cryptographic community following the publication of this paper. While the exact moment the method received its name isn't precisely documented, it is common practice in academic and technical communities to name significant contributions after their inventors or authors soon after their discovery or publication. Therefore, the term "Diffie-Hellman key exchange" would have gained prominence in the late 1970s.
- I: When was the name "Diffie-Hellman key agreement" first used?
- ChatGPT: The term "Diffie-Hellman key agreement" was first used in the 1980s, as the concept evolved and the terminology around it became more precise. The original paper by Whitfield Diffie and Martin Hellman in 1976 described the mechanism as a method of secure key exchange. As the cryptographic community continued to develop and refine the protocol, the term "key agreement" became more commonly used to reflect the protocol's purpose more accurately.
- While the exact date or publication where "Diffie-Hellman key agreement" was first used is not definitively recorded, it is clear that by the mid-1980s, the term had become standard in the cryptographic literature. This shift in terminology helped emphasize that both parties in the communication process contribute to the creation of a shared secret, rather than one party simply "exchanging" a key with the other. AliBabbaD (talk) 11:55, 2 September 2024 (UTC)
- If the process is in fact most commonly known today as "... agreement", as you imply when you say
by the mid-1980s, the term had become standard in the cryptographic literature
, then that is the title we should be using, regardless of what it was named originally. Largoplazo (talk) 12:18, 2 September 2024 (UTC)
- If the process is in fact most commonly known today as "... agreement", as you imply when you say
- The plant known as "Jerusalem artichoke" is neither an artichoke nor from Jerusalem, but it is nevertheless most commonly known as Jerusalem artichoke and, therefore, that's what the article is named. If you were to argue that we should name the article something more accurate out of concern for confusing the reader, I would say that (a) we'd be confusing them more by calling the thing something other than the name by which it's known and (b) if you're determined that the world be educated as to what's wrong with the plant's existing name, changing the title of the Wikipedia article about it is about as ineffective way to do that as can be imagined. You'd need to initiate a worldwide campaign to persuade people to stop calling it by that inaccurate name first. If you succeeded, then Wikipedia would align itself with the new normal. Largoplazo (talk) 12:15, 2 September 2024 (UTC)
- Given that your reply to my previous contribution (AliBabbaD (talk) 11:55, 2 September 2024 (UTC)) was 3 minutes later than this one I assume that you now agree with me that we should be using the "... agreement" title.
- How do we take it from here? AliBabbaD (talk) 15:40, 2 September 2024 (UTC)
- I agree if your assertion as to which term is more common is correct. Until I saw you say it, it wasn't the impression that I'd been given. It'd be best if we had a consensus to that effect, bringing in evidence if necessary to achieve it.
- At this point, the logical next step would be to initiate a formal move discussion following the instructions for a potentially controversial move at WP:Requested moves and pursue this there, referencing the preceding discussion here in the move nomination for context. Largoplazo (talk) 15:58, 2 September 2024 (UTC)
- Just to back up the claim that I made earlier, the dialog with ChatGPT continues …
- I: What is the evidence for the assertion that the term "key agreement" became more commonly used?
- ChatGPT: The assertion that the term "key agreement" became more commonly used over time, particularly in the cryptographic community, is supported by several factors:
- Evolving Cryptographic Standards: As cryptographic protocols became standardized, terminology evolved to reflect more precise meanings. The term "key agreement" started to be favored in standards and technical documents because it accurately described the process where both parties collaboratively agree on a shared secret, rather than merely "exchanging" it. This is evident in standards such as those from the National Institute of Standards and Technology (NIST) and ISO/IEC.
- Cryptographic Literature: Over the years, as more research papers and textbooks were published on cryptography, the term "key agreement" was increasingly used in the titles and texts. Authors began to distinguish between "key exchange" (which could imply one-way transfer of a key) and "key agreement" (which emphasizes mutual contribution to the key).
- Protocols and Algorithms: As new cryptographic protocols were developed, the term "key agreement" was used to describe processes where both participants have an active role in determining the final key. This distinction became important as other protocols and variations (e.g., authenticated key agreement protocols) were introduced.
- Historical Usage: The earliest mentions of "key agreement" in the literature can be traced back to the early 1980s, shortly after the introduction of the Diffie-Hellman protocol. For example, papers and books from this period start to make a clearer distinction between different types of key management protocols, and "key agreement" becomes more frequent in these discussions.
- While it is difficult to pinpoint a single piece of evidence that marks the exact moment when "key agreement" overtook "key exchange" in popularity, the trend is observable in the growing use of the term in cryptographic standards, literature, and educational materials throughout the 1980s and 1990s. This shift reflects the community's move towards more precise and accurate descriptions of cryptographic processes. AliBabbaD (talk) 16:41, 2 September 2024 (UTC)
- Do not ever bother seeing what AI has to say about anything.
- I once saw a question online from someone who was trying to identify a card game given only that the 7 card is assigned the value 5. I decided to submit the question to ChatGPT 3.5:
- I asked "Is there a card game that assigns a point value of 5 to the 7 card?"
- It responded "Yes, in the card game Euchre, the 7 card of the trump suit is assigned a point value of 5. Euchre is typically played with a standard deck of 24 cards (including the 9, 10, J, Q, K, and A of each suit) and is popular in certain regions of the United States and Canada. The objective of the game is to be the first team to reach a predetermined number of points, usually 10 or 11."
- Euchre doesn't assign point values to cards, and if it's played only with cards 9, 10, J, Q, K, and A, then where would the 7 card come into it anyway? So I typed "That's incorrect."
- The AI responded "I apologize for the mistake. There is no card game that universally assigns a point value of 5 to the 7 card. ... Thank you for pointing out the error, and I appreciate the opportunity to correct it."
- I came back a couple of days later, posed the same question, and got pretty much the same initial response. ChatGPT isn't even programmed to learn from its own mistakes. But, on the other hand, somehow it had the resources it needed, after I told it that it was wrong, to satisfy itself sufficiently that that was true to respond as it did.
- Bottom line: AI is an abominably poor source of information. Largoplazo (talk) 16:57, 2 September 2024 (UTC)
- I would say "Do not bother asking AI leading questions". If you try to pull the wool over AI's eyes, you will succeed. But ChatGPT can be invaluable of giving hints. Bottom line: I couldn't disagree more with your bottom line. AliBabbaD (talk) 14:02, 3 September 2024 (UTC)
- ChatGPT gives wrong answers therefore it is unreliable. I don't know what you think "leading question" means. I just asked a question, I didn't suggest what the answer should be (which is what would make it a leading question). Largoplazo (talk) 16:20, 3 September 2024 (UTC)
- I would say "Do not bother asking AI leading questions". If you try to pull the wool over AI's eyes, you will succeed. But ChatGPT can be invaluable of giving hints. Bottom line: I couldn't disagree more with your bottom line. AliBabbaD (talk) 14:02, 3 September 2024 (UTC)
- Largoplazo (talk) 16:57, 2 September 2024 (UTC) has made me try and find out how ChatGPT arrived at its conclusion about "key agreement" vs. "key exchange". I found these articles:
- https://kzero.com/resources/glossary/key-agreement-vs-key-exchange-definition-2 that refers to Diffie-Hellman in the context of Key-Agreement.
- https://encyclopedia.kaspersky.com/glossary/diffie-hellman-protocol-dh that refers both to Diffie–Hellman protocol as well as Diffie–Hellman method.
- Maybe there is a more elegant and probably far less controversial way out of the impasse. Potentially we could rename the Diffie-Hellman key exchange article to Diffie–Hellman protocol or Diffie–Hellman method, adjust its content as needed and make the redirections that currently point to Diffie-Hellman key exchange point to the renamed article instead. AliBabbaD (talk) 14:37, 3 September 2024 (UTC)
Requested move 4 September 2024
[edit]
![]() | It has been proposed in this section that Diffie–Hellman key exchange be renamed and moved to Diffie-Hellman Method. A bot will list this discussion on the requested moves current discussions subpage within an hour of this tag being placed. The discussion may be closed 7 days after being opened, if consensus has been reached (see the closing instructions). Please base arguments on article title policy, and keep discussion succinct and civil. Please use {{subst:requested move}} . Do not use {{requested move/dated}} directly. |
Diffie–Hellman key exchange → Diffie-Hellman Method – On first encountering "Diffie-Hellman key exchange", the image evoked in my head was that A and B somehow exchange their secret key and I'm probably not alone. A Google search for "key agreement vs key exchange diffie hellman" is quite illuminating. All non-Wikipedia articles indicate that the most Generic term ("Diffie-Hellman Method") would be better-suited to serve as title for the description of this method/protocol than a title that highlights any particular aspect of the method such as “key exchange”. AliBabbaD (talk) 21:27, 4 September 2024 (UTC) AliBabbaD (talk) 21:11, 4 September 2024 (UTC)
- Once the move has been performed, some rephrasing would be necessary, in particular to the current introduction. It could be rephrased as follows:
- The Diffie–Hellman (DH) Method allows two users to agree on a shared secret by sharing public cryptographic keys over a public channel. DH was conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman and was in use as one of the first public-key protocols. Common names for DH include Diffie–Hellman key exchange and Diffie–Hellman key agreement [nb 1]. [1][2] DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography. Published in 1976 by Diffie and Hellman, this is the earliest publicly known work that proposed the idea of a private key and a corresponding public key. AliBabbaD (talk) 21:35, 4 September 2024 (UTC)
- Oppose, first, because "Diffie–Hellman Method" is a violation of MOS:TITLECASE, and second, and more substantively, because look at this Google Ngram and this one, showing that in Google Books' corpus of books in English, "Diffie-Helman method" is practically non-existent, and therefore not an apt title for the article. Largoplazo (talk) 22:52, 4 September 2024 (UTC)
- This Google Ngram shows "Diffie-Hellman" far more often used than "Diffie-Hellman key" let alone "Diffie-Hellman key exchange". "Diffie-Hellman" on its own, obviously refers to the same key agreement method as this article. Both Diffie-Hellman or Diffie–Hellman, by your reasoning, would therefore be ideal move targets. They, however, are redirects to this article, which disallows them to be move targets.
- Hence, it might be pragmatic to put the move request on ice and just do rephrasing in this article, in particular to the current introduction. It could be rephrased as follows:
- Diffie-Hellman (DH) is a method that allows two users to agree on a shared secret by sharing public cryptographic keys over a public channel. DH was conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman and was in use as one of the first public-key protocols. Common names for DH include Diffie-Hellman key exchange and Diffie-Hellman key agreement [nb 1]. [1][2] DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography. Published in 1976 by Diffie and Hellman, this is the earliest publicly known work that proposed the idea of a private key and a corresponding public key. AliBabbaD (talk) 13:16, 5 September 2024 (UTC)
- (I'll likely reply with thoughts on the merits in a new top level comment when I have time.) "Diffie-Hellman" will almost always get more hits than "Diffie-Hellman <something>" in ngrams since the former is a strict prefix of the latter. But that doesn't always mean "X", instead of "X Y", is actually more commonly used as the name of X Y if X also appears as not the name, of course.
- Second, for any future requested moves and for the purpose if proposed alternatives during this discussion, move targets can be redirects in WP:Requested moves, see Talk:Maclura pomifera § Requested move 2 September 2024 for an example. (Perhaps you're thinking of the technical restriction that most users cannot move an article over a redirect back with more than one revision? See WP:MOVEOVERREDIRECT.) Skynxnex (talk) 14:16, 5 September 2024 (UTC)
- This Ngram comparing "Diffie-Hellman" and "Diffie-Hellman *" gives further credence to my claim that in this case "X" ( ="Diffie-Hellman") almost certainly means "X Y" (= "Diffie-Hellman key *").
- Many thanks for the hint re WP:MOVEOVERREDIRECT. I would still think that in present circumstances, the article should be rephrased as indicated first before doing a move. AliBabbaD (talk) 15:08, 5 September 2024 (UTC)
- "Diffie Hellman" alone is part of every variation of the name of the process. The count you're getting from it isn't the count of the use of "Diffie Hellman" without being followed by any of the phrases "key exchange", "key agreement", "method" or any other noun or noun phrase, it's the count of sources with any of the variations. Largoplazo (talk) 14:54, 5 September 2024 (UTC)
- What else should link Diffie and Hellman? That they may have been socialising? AliBabbaD (talk) 15:12, 5 September 2024 (UTC)
- That's not the point. The point is that any search for X alone will always yield at least as results than any search for a specific phrase beginning with X such as X Y or X A B C, because it will include those results as well as all others that contain "X" and don't have the more specific phrase in them. In other words,
- count of works containing "X" = (count of works containing "X Y") + (count of works not containing "X" but not "X Y")
- which is, therefore, at least as large as, and usually much larger than, (count of works containing "X Y") alone.
- You reported this as though it was comparable to the comparison I ran. Comparing the results for one phrase against a part of that phrase is entirely different from comparing the counts for two specific phrases, neither of which is contained in the other. Largoplazo (talk) 16:25, 5 September 2024 (UTC)
- See also https://books.google.com/ngrams/graph?content=Diffie-Hellman%2CDiffie-Hellman+key%2CDiffie-Hellman+key+exchange&year_start=1980&year_end=2022&corpus=en&smoothing=3&case_insensitive=true AliBabbaD (talk) 15:17, 5 September 2024 (UTC)
- Self-evident result, see my previous explanation. Largoplazo (talk) 16:27, 5 September 2024 (UTC)
- You appear to ignore that "X" is special in that it combines "Diffie" and "Hellman".
- How about this: You take a 100 randomly chosen works that contain "Diffie-Hellman". You will find around 25 that contain "Diffie-Hellman" followed by "key" and possibly one or two that will refer to something other than the key agreement method.
- Were "X" = "Caesar", of the 100 randomly chosen works the subject of Salad would outnumber the other subjects but would only be around 14 out of the 100. AliBabbaD (talk) 18:55, 5 September 2024 (UTC)
- Try this: https://www.google.com/search?q=google+books+on+diffie-hellman AliBabbaD (talk) 19:10, 5 September 2024 (UTC)
- I'm not "ignoring" anything. What I said is true whether X is "Mary" or "Diffie-Hellman" or "Who the hell is", and Y is any specific thing that occurs in the corpus immediately after X. What do you think is special about "Diffie-Hellman"?
- I further don't understand what point you're trying to make with your Caesar example. You seem to be getting further and further from the significance of the Ngrams I presented. This is a specific move request, to change the title of the article to "Diffie-Hellman Method". Compared with occurrences of "Diffie-Hellman key exchange", occurrences of "Diffie-Hellman method" in the literature are virtually nonexistent, demonstrating that there is zero justification for changing the title of the article to "Diffie-Hellman method" (and, because of the guidelines, "Diffie-Hellman Method" isn't even allowed).
- Update: I think I just figured out what you're doing. Is it that you think I'm arguing that the current title is the most commonly used name? And that you disagree with me on that? That isn't what I'm arguing. This move request discussion isn't about whether the title should be changed at all. It's about whether it should be change to "Diffie-Hellman method". I'm arguing that it shouldn't be that title. Largoplazo (talk) 20:05, 5 September 2024 (UTC)
- Thank you for this update. That the title should not change to "Diffie-Hellman method" had already become clear to me once I had read your initial "Oppose" reply (Largoplazo (talk) 22:52, 4 September 2024 (UTC). I may not have expressed this clearly enough in my response. I will now at the top level "Oppose" the request myself. AliBabbaD (talk) 13:18, 6 September 2024 (UTC)
- Self-evident result, see my previous explanation. Largoplazo (talk) 16:27, 5 September 2024 (UTC)
- What else should link Diffie and Hellman? That they may have been socialising? AliBabbaD (talk) 15:12, 5 September 2024 (UTC)
- Oppose. Thanks to the reasoning of Largoplazo's and Skynxnex' contributions, I have come to realise that the title should not change to "Diffie-Hellman method" and, moreover, that it may be sufficient to just rephrase the article. In particular the current introduction could be rephrased as follows:
- Diffie-Hellman (DH) is a method that allows two users to agree on a shared secret by sharing public cryptographic keys over a public channel. DH was conceived by Ralph Merkle and named after Whitfield Diffie and Martin Hellman and was in use as one of the first public-key protocols. Common names for DH include Diffie-Hellman key exchange and Diffie-Hellman key agreement [nb 1]. [1][2] DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography. Published in 1976 by Diffie and Hellman, this is the earliest publicly known work that proposed the idea of a private key and a corresponding public key.
- Please let me know, if you would agree with this approach. Once the editing has been done, I could then make a new Move request to "Diffie-Hellman". AliBabbaD (talk) 13:18, 6 September 2024 (UTC)
- I just noticed that the proposed rephrasing is inaccurate in describing Merkle's role. A number of links was also missing. The introduction should therefore read as follows:
- Diffie-Hellman (DH) is a method that allows two users to agree on a shared secret by exchanging public cryptographic keys over a public channel. DH was named after Whitfield Diffie and Martin Hellman[1] and was in use as one of the first public-key protocols as conceived by Ralph Merkle[2]. Common names for DH include Diffie-Hellman key exchange and Diffie-Hellman key agreement[nb 1]. DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography. Published in 1976 by Diffie and Hellman, this is the earliest publicly known work that proposed the idea of a private key and a corresponding public key.
- AliBabbaD (talk) 16:18, 6 September 2024 (UTC)
- In general the lead of an article should start with the title, though exceptions are spelled out, such as at MOS:FULLNAME for names of people. Largoplazo (talk) 16:29, 6 September 2024 (UTC)
- The current phrasing in fact already deviates from this convention in that it uses "Diffie–Hellman (DH) key exchange" (and not "Diffie–Hellman key exchange"). Using Diffie-Hellman by itself anticipates the move of the article. Nevertheless, swapping sentences 2 and 3 would be a good idea:
- Diffie-Hellman (DH) is a method that allows two users to agree on a shared secret by exchanging public cryptographic keys over a public channel. Common names for DH include Diffie-Hellman key exchange and Diffie-Hellman key agreement[nb 2]. DH was named after Whitfield Diffie and Martin Hellman[3] and was in use as one of the first public-key protocols as conceived by Ralph Merkle[4]. DH is one of the earliest practical examples of public key exchange implemented within the field of cryptography. Published in 1976 by Diffie and Hellman, this is the earliest publicly known work that proposed the idea of a private key and a corresponding public key. AliBabbaD (talk) 17:10, 6 September 2024 (UTC)
- In general the lead of an article should start with the title, though exceptions are spelled out, such as at MOS:FULLNAME for names of people. Largoplazo (talk) 16:29, 6 September 2024 (UTC)
References
- ^ Diffie, Whitfield; Hellman, Martin E. (November 1976). "New Directions in Cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. CiteSeerX 10.1.1.37.9720. doi:10.1109/TIT.1976.1055638. Archived (PDF) from the original on 2014-11-29.
- ^ Merkle, Ralph C. (April 1978). "Secure Communications Over Insecure Channels". Communications of the ACM. 21 (4): 294–299. CiteSeerX 10.1.1.364.5157. doi:10.1145/359460.359473. S2CID 6967714.
Received August, 1975; revised September 1977
- ^ Diffie, Whitfield; Hellman, Martin E. (November 1976). "New Directions in Cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. CiteSeerX 10.1.1.37.9720. doi:10.1109/TIT.1976.1055638. Archived (PDF) from the original on 2014-11-29.
- ^ Merkle, Ralph C. (April 1978). "Secure Communications Over Insecure Channels". Communications of the ACM. 21 (4): 294–299. CiteSeerX 10.1.1.364.5157. doi:10.1145/359460.359473. S2CID 6967714.
Received August, 1975; revised September 1977
Cite error: There are <ref group=nb>
tags on this page, but the references will not show without a {{reflist|group=nb}}
template (see the help page).
- C-Class vital articles
- Wikipedia level-5 vital articles
- Wikipedia vital articles in Technology
- C-Class level-5 vital articles
- Wikipedia level-5 vital articles in Technology
- C-Class vital articles in Technology
- C-Class Computing articles
- Mid-importance Computing articles
- All Computing articles
- C-Class Computer science articles
- Mid-importance Computer science articles
- WikiProject Computer science articles
- C-Class Cryptography articles
- Top-importance Cryptography articles
- WikiProject Cryptography articles
- C-Class mathematics articles
- Mid-priority mathematics articles
- Requested moves