Search results

Page title matches

• Diffie-Hellman
  ...ey agreement protocol''' (also called Diffie-Hellman key exchange, or just Diffie-Hellman, D-H or DH) <ref name=RFC2631>{{citation | title = Diffie-Hellman Key Agreement Method
  6 KB (954 words) - 05:48, 8 April 2024
• Diffie-Hellman/Definition
  307 bytes (49 words) - 03:43, 16 October 2008
• Diffie-Hellman/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Diffie-Hellman]]. Needs checking by a human.
  608 bytes (77 words) - 15:58, 11 January 2010

Page text matches

• Discrete logarithm/Related Articles
  {{r|Diffie-Hellman}}
  307 bytes (40 words) - 11:59, 15 June 2009
• Asymmetric key cryptography/Related Articles
  {{r|Diffie-Hellman}}
  398 bytes (43 words) - 20:00, 29 July 2010
• Diffie-Hellman/Related Articles
  Auto-populated based on [[Special:WhatLinksHere/Diffie-Hellman]]. Needs checking by a human.
  608 bytes (77 words) - 15:58, 11 January 2010
• History of cryptography/Related Articles
  {{r|Diffie-Hellman}}
  654 bytes (85 words) - 17:13, 11 January 2010
• Diffie-Hellman
  ...ey agreement protocol''' (also called Diffie-Hellman key exchange, or just Diffie-Hellman, D-H or DH) <ref name=RFC2631>{{citation | title = Diffie-Hellman Key Agreement Method
  6 KB (954 words) - 05:48, 8 April 2024
• Cryptographic key/Related Articles
  {{r|Diffie-Hellman}}
  1 KB (132 words) - 14:31, 22 March 2024
• Asymmetric key cryptography
  ...ideas at the time, and Hellman has suggested that the term used should be Diffie-Hellman-Merkle asymmetric key cryptography.</ref>. The historian David Kahn descri ...llman showed that public-key cryptography was possible by presenting the [[Diffie-Hellman]] key exchange protocol.<ref name=dh2>{{citation
  8 KB (1,233 words) - 05:48, 8 April 2024
• Better than nothing security
  ...tication is used. The [[Internet Key Exchange]] (IKE) protocol is based on Diffie-Hellman; in normal IPsec usage it includes authentication and therefore does resist
  3 KB (516 words) - 05:48, 8 April 2024
• Cryptology/Related Articles
  {{r|Diffie-Hellman}}
  1 KB (173 words) - 14:49, 4 April 2024
• Hybrid cryptosystem
  * use a [[Diffie-Hellman]] exchange to generate some shared keying material. D-H is insecure without ...requires that both players have a good [[random number generator]] for the Diffie-Hellman protocol. Some variants also require a secure method of expanding a relativ
  3 KB (544 words) - 05:49, 8 April 2024
• Cryptography/Related Articles
  {{r|Diffie-Hellman}}
  2 KB (194 words) - 14:48, 4 April 2024
• Man-in-the-middle attack
  ...authentication mechanism is in play. For example, if Alice and Bob do a [[Diffie-Hellman]] key negotiation, they much each authenticate themselves to the other.<ref | title = Diffie-Hellman Key Agreement Method
  7 KB (1,015 words) - 05:48, 8 April 2024
• Key management
  ...physical devices and [[smartcard]]s to cryptographic techniques such as [[Diffie-Hellman]]. In some cases, an entire [[public key infrastructure]] may be involved.
  3 KB (459 words) - 05:49, 8 April 2024
• Cryptographic key
  ...[[key exchange key]] (KEK). Alternately a key agreement protocol such as [[Diffie-Hellman]] may be used; in these the two systems co-operate to securely create a key
  3 KB (523 words) - 05:49, 8 April 2024
• Discrete logarithm
  ...log problem is the basis of several cryptographic systems, including the [[Diffie-Hellman]] key agreement used in many applications including the IKE ([[Internet Key
  5 KB (772 words) - 17:15, 6 August 2013
• Key (cryptography)
  ...nsient keys among parties to the communication. One common method is the [[Diffie-Hellman]] key agreement protocol.
  4 KB (564 words) - 23:12, 4 February 2010
• History of cryptology
  ...the public specification of DES (the [[Data Encryption Standard]]), the [[Diffie-Hellman]] paper,<ref name=dh2>{{citation
  9 KB (1,312 words) - 05:49, 8 April 2024
• IPsec
  ...otiates connection parameters, including keys, for the other two using a [[Diffie-Hellman]] technique. <ref name=RFC4306>{{citation | ===Diffie-Hellman key agreement===
  40 KB (6,219 words) - 05:49, 8 April 2024
• Cryptography
  ...rticle for details. The most widely used public techniques today are the [[Diffie-Hellman]] key agreement protocol and the [[RSA public-key system]]<ref name=RSA>{{c ...blem &mdash; [[integer factorisation]] for RSA, [[discrete logarithm]] for Diffie-Hellman, and so on. These problems are generally thought to be hard; no general sol
  52 KB (8,332 words) - 05:49, 8 April 2024
• Cryptanalysis/Citable Version
  ...roblem &mdash; the [[RSA algorithm]] from [[integer factorisation]], the [[Diffie-Hellman]] protocol from the [[discrete logarithm]] problem, and other systems from
  32 KB (4,913 words) - 14:38, 18 March 2024