Search results
Jump to navigation
Jump to search
Page title matches
- A '''birthday attack''' is a [[cryptanalysis | cryptanalytic]] attack based on the mathematics e ...needed. A 256-bit hash is required to give 2<sup>128</sup> resistance to a birthday attack.3 KB (415 words) - 05:48, 8 April 2024
- 12 bytes (1 word) - 09:37, 1 November 2008
- | pagename = Birthday attack | abc = Birthday attack958 bytes (97 words) - 23:37, 1 March 2010
- 132 bytes (19 words) - 22:02, 1 November 2008
- 141 bytes (15 words) - 19:39, 3 January 2009
Page text matches
- {{r|birthday attack}}237 bytes (29 words) - 01:06, 22 March 2009
- {{r|birthday attack}}287 bytes (37 words) - 18:47, 3 January 2009
- {{r|Birthday attack}}701 bytes (92 words) - 10:46, 5 January 2009
- {{r|Birthday attack}}854 bytes (123 words) - 01:07, 2 November 2008
- | pagename = Birthday attack | abc = Birthday attack958 bytes (97 words) - 23:37, 1 March 2010
- {{r|Birthday attack}}164 bytes (19 words) - 16:18, 7 July 2010
- {{rpl|Birthday attack}}2 KB (243 words) - 17:48, 13 March 2024
- A '''birthday attack''' is a [[cryptanalysis | cryptanalytic]] attack based on the mathematics e ...needed. A 256-bit hash is required to give 2<sup>128</sup> resistance to a birthday attack.3 KB (415 words) - 05:48, 8 April 2024
- ...]], whenever two things to turn out coincidentally the same is an issue ([[birthday attack]]).4 KB (538 words) - 01:33, 9 July 2010
- A [[birthday attack]] can be used whenever the issue is finding repeated output from some crypt3 KB (440 words) - 05:49, 8 April 2024
- I've just added an article [[birthday attack]] on a cryptographic application of the birthday paradox, with a link from ...eferences and is used in government standards, see the last paragraph of [[birthday attack]]. However, I've never seen a proof and do not know if it is a theorem or j4 KB (614 words) - 05:18, 19 October 2010
- The challenge must be large enough to prevent a [[birthday attack]]. With a challenge of 2<sup>n</sup> bits, an attacker who logs the data fr2 KB (382 words) - 05:49, 8 April 2024
- ...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>blocksiz6 KB (1,064 words) - 02:04, 24 January 2017
- ...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 possible11 KB (1,819 words) - 05:48, 8 April 2024
- ...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<sup>64</sup> to 2<sup>80</sup>. Also, there is an expansion step w16 KB (2,641 words) - 15:51, 8 April 2024
- A [[birthday attack]] can be used whenever the issue is finding repeated output from some crypt32 KB (4,913 words) - 14:38, 18 March 2024
- A [[birthday attack]] can be used whenever the issue is finding repeated output from some crypt32 KB (4,916 words) - 05:49, 8 April 2024
- Because of the [[birthday attack]], a [[cryptographic hash]] needs to provide output of <math>2n</math> bits21 KB (3,252 words) - 05:49, 8 April 2024
- ...e attack]], [[Man-in-the-middle attack]], [[Meet-in-the-middle attack]], [[birthday attack]] and [[Snake (animal) oil (cryptography)]]. Should [[rewrite attack]] beco ...SA]], [[discrete logarithm]], [[Hashed message authentication code]] and [[Birthday attack]] history shows me as the only editor, except for a couple of trivial copy64 KB (10,458 words) - 18:02, 1 April 2024
- ...d [[active attack]] each linking to several actual attacks. There's also [[birthday attack]]. I have not tried to write [[linear cryptanalysis]] or [[differential cry69 KB (10,750 words) - 09:02, 4 May 2024