Time/memory/data tradeoff attack

Key takeaways

Time/memory/data tradeoff attack belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Time/memory/data tradeoff attack to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Time/memory/data tradeoff attack from memory before moving on to harder problems.

Reference excerpt

A time/memory/data tradeoff attack is a type of cryptographic attack where an attacker tries to achieve a situation similar to the space–time tradeoff but with the additional parameter of data, representing the amount of data available to the attacker. An attacker balances or reduces one or two of those parameters in favor of the other one or two. This type of attack is very difficult, so most of the ciphers and encryption schemes in use were not designed to resist it.

History Tradeoff attacks on symmetric cryptosystems date back to 1980, when Martin Hellman suggested a time/memory tradeoff method to break block ciphers with N {\displaystyle N} possible keys in time T {\displaystyle T} and memory M {\displaystyle M} related by the tradeoff curve T M 2 = N 2 {\displaystyle T{M^{2}}={N^{2}}} where 1 ≤ T ≤ N {\displaystyle 1\leq T\leq N} . Later, in 1995, Babbage and Golic devised a different tradeoff attack for stream ciphers with a new bound such that T M = N {\displaystyle TM=N} for 1 ≤ T ≤ D {\displaystyle 1\leq T\leq D} where D {\displaystyle D} is the output data available to the cryptanalyst at real time.

Attack mechanics This attack is a special version of the general cryptanalytic time/memory tradeoff attack, which has two main phases:

Preprocessing: During this phase, the attacker explores the structure of the cryptosystem and is allowed to record their findings in large tables. This can take a long time. Realtime: In this phase, the cryptanalyst is granted real data obtained from a specific unknown key. They then try to use this data with the precomputed table from the preprocessing phase to find the particular key in as little time as possible. Any time/memory/data tradeoff attack has the following parameters:

N {\displaystyle N} search space size

P {\displaystyle P} time required for the preprocessing phase

T {\displaystyle T} time required for the realtime phase

M {\displaystyle M} amount of memory available to the attacker

D {\displaystyle D} amount of realtime data available to the attacker

Hellman's attack on block ciphers For block ciphers, let N {\displaystyle N} be the total number of possible keys and also assume the number of possible plaintexts and ciphertexts to be N {\displaystyle N} . Also let the given data be a single ciphertext block of a specific plaintext counterpart. If we consider the mapping from the key x {\displaystyle x} to the ciphertext y {\displaystyle y} as a random permutation function f {\displaystyle f} over an N {\displaystyle N} point space, and if this function f {\displaystyle f} is invertible; we need to find the inverse of this function f − 1 ( y ) = x {\displaystyle {f}^{-1}(y)=x} . Hellman's technique to invert this function:

During the preprocessing stage Try to cover the N {\displaystyle N} point space by an m × t {\displaystyle m\times t} rectangular matrix that is constructed by iterating the function f {\displaystyle f} on m {\displaystyle m} random starting points in N {\displaystyle N} for t {\displaystyle t} times. The start points are the leftmost column in the matrix and the end points are the rightmost column. Then store the pairs of start and end points in increasing order of end points values.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Time/memory/data tradeoff attack

Start with the simplest possible case. Write down what Time/memory/data tradeoff attack claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Time/memory/data tradeoff attack before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Time/memory/data tradeoff attack ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Time/memory/data tradeoff attack

In research: Time/memory/data tradeoff attack appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Time/memory/data tradeoff attack in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Time/memory/data tradeoff attack is common in secondary-school and first-year university syllabi. It links to neighbouring topics Cryptographic attacks, so understanding it makes those chapters shorter.
In everyday life: Look for Time/memory/data tradeoff attack outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Time/memory/data tradeoff attack in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Time/memory/data tradeoff attack means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Time/memory/data tradeoff attack out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Time/memory/data tradeoff attack in simple terms?

A time/memory/data tradeoff attack is a type of cryptographic attack where an attacker tries to achieve a situation similar to the space–time tradeoff but with the additional parameter of data, representing the amount of data available to the attacker. An attacker balances or reduces one or two of…

Why does Time/memory/data tradeoff attack matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Time/memory/data tradeoff attack?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Time/memory/data tradeoff attack.