Ataque de
fuerza bruta que busca colisiones probando todas las combinaciones posibles de
2 textos.
Se basa en la
paradoja del cumpleaños, que se puede resumir diciendo que la probabilidad de
que dos o más personas en un grupo de individuos hayan nacido el mismo día, es
superior al 50% cuando el número de personas es igual o mayor que 23 sujetos.
(I) A class of attacks
against cryptographic functions, including both encryption functions and hash
functions. The attacks take advantage of a statistical property: Given a
cryptographic function having an N-bit output, the probability is greater than
1/2 that for 2**(N/2) randomly chosen inputs, the function will produce at
least two outputs that are identical. (See: Tutorial under "hash
function".) [RFC4949:2007]
A brute-force attack used to
find collisions. It gets its name from the surprising result that the
probability of two or more people in a group of 23 sharing the same birthday is
greater than 1/2.
http://www.rsasecurity.com/rsalabs/faq