Linear Cryptanalysis & Approximation Tables
Build linear approximation tables and recover key bits statistically.
What Is Linear Cryptanalysis?
Linear cryptanalysis (Matsui, 1993) is a known-plaintext attack that finds linear approximations (XOR of specific bits) of a cipher that hold with probability p ≠ 1/2. Using many plaintext-ciphertext pairs, statistical bias reveals key bits.
Linear Approximation
A linear approximation for an S-box: sum of selected input bits XOR sum of selected output bits = 0 (mod 2) with probability p. Expressed as: P[a·x XOR b·y = 0] = 1/2 + ε, where a,b are bit masks and ε is the bias (|ε| >> 0 is desirable).
All lessons in this course
- Differential Cryptanalysis Fundamentals
- Linear Cryptanalysis & Approximation Tables
- Birthday & Collision Attacks
- Meet-in-the-Middle & Time-Memory Trade-offs