Return to the differential-analysis wiki

In practice, this is usually a chosen-plaintext attack with a quite large number of plaintexts (but for "broken" algorithms still smaller than the key space).

The terminology is presented by Biham and Shamir and within IBM, the attack was formerly known as the “T attack”

In practice, this is usually a chosen-plaintext attack with a quite large number of plaintexts (but for "broken" algorithms still smaller than the key space).

The terminology is presented by Biham and Shamir and within IBM, the attack was formerly known as the "T-attack" or ”tickle attack.

In practice, this is usually a chosen-plaintext attack with a quite large number of plaintexts (but for "broken" algorithms still smaller than the key space).

In practice, this is usually a chosen-plaintext attack with a quite large number of plaintexts (but for "broken" algorithms still smaller than the key space).

The terminology is presented by Biham and Shamir and within IBM, the attack was formerly known as the “T attack”

In practice, this is usually a chosen-plaintext attack with a quite large number of plaintexts (but for "broken" algorithms still smaller than the key space).