Search results

Page title matches

• Birthday attack
  A '''birthday attack''' is a [[cryptanalysis | cryptanalytic]] attack based on the mathematics e ...needed. A 256-bit hash is required to give 2¹²⁸ resistance to a birthday attack.
  3 KB (415 words) - 05:48, 8 April 2024
• Birthday attack/Definition
  132 bytes (19 words) - 22:02, 1 November 2008
• Birthday attack/Related Articles
  141 bytes (15 words) - 19:39, 3 January 2009

Page text matches

• Passive attack/Related Articles
  {{r|birthday attack}}
  237 bytes (29 words) - 01:06, 22 March 2009
• Code book attack/Related Articles
  {{r|birthday attack}}
  287 bytes (37 words) - 18:47, 3 January 2009
• Cryptanalysis/Related Articles
  {{r|Birthday attack}}
  701 bytes (92 words) - 10:46, 5 January 2009
• Meet-in-the-middle attack/Related Articles
  {{r|Birthday attack}}
  854 bytes (123 words) - 01:07, 2 November 2008
• Birthday paradox/Related Articles
  {{r|Birthday attack}}
  164 bytes (19 words) - 16:18, 7 July 2010
• Birthday attack
  A '''birthday attack''' is a [[cryptanalysis | cryptanalytic]] attack based on the mathematics e ...needed. A 256-bit hash is required to give 2¹²⁸ resistance to a birthday attack.
  3 KB (415 words) - 05:48, 8 April 2024
• Birthday paradox
  ...]], whenever two things to turn out coincidentally the same is an issue ([[birthday attack]]).
  4 KB (538 words) - 01:33, 9 July 2010
• Passive attack
  A [[birthday attack]] can be used whenever the issue is finding repeated output from some crypt
  3 KB (440 words) - 05:49, 8 April 2024
• Challenge-response protocol
  The challenge must be large enough to prevent a [[birthday attack]]. With a challenge of 2ⁿ bits, an attacker who logs the data fr
  2 KB (382 words) - 05:49, 8 April 2024
• Code book attack
  ...be the same, giving the enemy some information, becomes significant: see [[birthday attack]]. For this reason, any block cipher must be re-keyed before 2<sup>blocksiz
  6 KB (1,064 words) - 02:04, 24 January 2017
• Brute force attack
  ...lisions in [[hash (cryptography)|hash function]]s, an attacker can use a [[birthday attack]]. This works a bit like meet-in-the-middle; instead of trying all possible
  11 KB (1,819 words) - 05:48, 8 April 2024
• Hash (cryptography)
  ...example, SHA-256 is used with AES-128. The strength of the hash against a birthday attack then roughly matches the strength of the cipher against a [[brute force att ...ds of internal state instead of four; this raises the strength against a [[birthday attack]] from 2⁶⁴ to 2⁸⁰. Also, there is an expansion step w
  16 KB (2,641 words) - 15:51, 8 April 2024
• Cryptanalysis/Citable Version
  A [[birthday attack]] can be used whenever the issue is finding repeated output from some crypt
  32 KB (4,913 words) - 14:38, 18 March 2024
• Cryptanalysis
  A [[birthday attack]] can be used whenever the issue is finding repeated output from some crypt
  32 KB (4,916 words) - 05:49, 8 April 2024
• AES competition
  Because of the [[birthday attack]], a [[cryptographic hash]] needs to provide output of <math>2n</math> bits
  21 KB (3,252 words) - 05:49, 8 April 2024