Cryptography Attacks

Birthday attack

A birthday attack is a type of cryptographic 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).

Mathematical attack

A mathematical attack refers to breaking the encryption by intercepting large quantities of encrypted information and using mathematical and statistical analysis to find the common factor or a hole in the encryption algorithm (a backdoor).

There are five main categories for this attack:

1- Ciphertext-only attack

2- Known plaintext attack

3- Chosen-plaintext attack

4- Chosen-ciphertext attack

5- Side-channel attack

Brute-Force Attack

In cryptography, a brute-force attack, or exhaustive key search, is a cryptanalytic attack that can, in theory, be used against any encrypted data (except for data encrypted in an information-theoretically secure manner).