• A type of cryptographic attack that exploits the mathematics behind the birthday problem in probability theory, which 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). Although there are some digital signature vulnerabilities associated with the birthday attack, it cannot be used to break an encryption scheme faster than a brute-force attack. ← Wikipedia

1. Related terms: Birthday problem, Replay attack, XML external entity attack, Timing attack
2. Previous term: Binding
3. Next term: Birthday problem
4. Random term: Out of memory (webglossary.info/random 🎲)