A method of cracking cryptographic algorithms through matches in hash functions. It is based on the birthday paradox, according to which the probability of two people sharing a birthday is far higher than it seems — for a group of 23 people, for example, the probability is 50%. Similarly, the probability of detecting a collision among target hash functions is much higher than might be expected, enabling an attacker to find matching fragments using fewer iterations.