Discover published sets by community

An attack in which the cryptanalyst has the capability to choose arbitrary plaintexts to encrypt and then studies the corresponding ciphertexts.

A technique that is based on how frequently certain letters appear in a language to break classical ciphers.

When the attacker has access to both the plaintext and its encrypted version, and seeks to discover other plaintexts or the key.

An attack using a pre-arranged list of likely passwords or phrases, such as those found in a dictionary.

An attack that involves inducing errors in a cryptographic computation to gain insight into the algorithm or key.

An attack where the attacker only has access to a collection of ciphertexts.

Targets block ciphers using sets of related plaintexts where certain properties are maintained across the plaintexts.

A type of attack on block ciphers that relies on solving systems of equations that are expected to be sparse in certain algebraic attacks.

An algebraic attack that assumes the cipher can be described by a low-degree polynomial and attempts to solve it.

A statistical attack on block ciphers, using linear approximations to describe the behavior of the cipher.

A type of side-channel attack where the attacker attempts to compromise a cryptosystem by analyzing the time taken to execute cryptographic algorithms.

Exploits the way some implementations of cryptographic protocols reveal whether a message has been correctly padded.

A cryptanalysis attack that uses differential cryptanalysis twice like a boomerang to analyze the encryption algorithm.

A time-memory trade-off attack using a precomputed table for reversing cryptographic hash functions.

A type of cryptanalysis that extends the meet-in-the-middle attack with structures called bicliques to solve certain block ciphers.

An attack where the attacker intercepts and possibly alters the communication between two parties who believe they are directly communicating.

Any attack based on information gained from the physical implementation of a cryptosystem, rather than brute force or theoretical weaknesses.

A method that models cryptographic algorithms as a system of algebraic equations that can be solved to find the key.

A type of attack on hash functions that exploits the mathematics behind the birthday problem in probability theory.

A cryptanalysis technique aimed at block ciphers where the attacker finds a differential path that is impossible to exist under certain circumstances.

A side-channel attack which involves monitoring the electrical power consumption of a cryptographic hardware device.

A colloquial term for acquiring cryptographic secrets (such as encryption keys) through coercion or threats.

An exhaustive search that tries every possible combination to find the encryption key or decrypt a message.

An attack that uses precomputed tables to reduce the time required to derive a key from its ciphertext.

An attack that exploits the use of multiple encryption layers, trying to find a common intermediate state from both ends.

An attack used primarily against RSA, exploiting the fact that for some messages, the RSA function can be iterated to find a cycle.

An advanced cryptanalysis technique in which the attacker analyzes the relationships between keys that are related in a known way.

This attack exploits cipher weaknesses when they process repeated identical operations or transformations over the dataset.

A method that studies how differences in input can affect the resultant difference at the output.