Metraipolis › archive › dc_a96375b3e013
Birthday attack — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Birthday_attack
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-05T23:20:22.724Z
- SHA-256 of the archived text
0ba9f975239acace1f4dd782d4887f70ec65175c9baea504dac2e92e4c7b991d- Stable URL of this page
https://metraipolis.com/documento/dc_a96375b3e013
How to cite
Birthday attack — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Birthday_attack (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a96375b3e013 (Metraipolis archive dc_a96375b3e013, sha256 0ba9f975239acace1f4dd782d4887f70ec65175c9baea504dac2e92e4c7b991d)
BibTeX
@misc{dca96375b3e013,
title = {Birthday attack — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Birthday_attack},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a96375b3e013; sha256 0ba9f975239acace1f4dd782d4887f70ec65175c9baea504dac2e92e4c7b991d},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Birthday_attack. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A birthday attack is a brute-force collision attack that exploits the mathematics behind the birthday problem in probability theory. This attack can be used to abuse communication between two or more parties. The attack depends on the higher likelihood of collisions found between random attack attempts and a fixed degree of permutations (pigeonholes). Let H {\textstyle H} be the number of possible values of a hash function, with H = 2 l {\textstyle H=2^{l}} . With a birthday attack, it is possible to find a collision of a hash function with 50 % {\textstyle 50\%} chance in 2 l = 2 l / 2 , {\textstyle {\sqrt {2^{l}}}=2^{l/2},} where l {\textstyle l} is the bit length of the hash output, and with 2 l − 1 {\textstyle 2^{l-1}} being the classical preimage resistance security with the same probability. There is a general (though disputed) result that quantum computers can perform birthday attacks, thus breaking collision resistance, in 2 l 3 = 2 l / 3 {\textstyle {\sqrt[{3}]{2^{l}}}=2^{l/3}} . Although there are some digital signature vulnerabilities associated with the birthday attack, it cannot be used to break an encryption scheme any faster than a brute-force attack.
Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «digital signature»).
Fonte: Wikipedia in inglese, voce «Birthday attack» — https://en.wikipedia.org/wiki/Birthday_attack
Wikidata Q615485 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q615485
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Birthday_attack?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1371240211, consultata il 2026-10-05T23:05:42.513Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 48b164f91c5d3259c11cac2403f21326369c7765eb70014eb12aa49b3b7d0a37