lecture 3 aes, feistel networks, des, ideal block ciphers - kth

AES Feistel Networks DES Ideal Block Cipher Perfect Secrecy Information Theory

Lecture 3

AES, Feistel Networks, DES, Ideal Block Ciphers,and Perfect Secrecy

Douglas WikstromKTH [email protected]

February 8, 2013

DD2448 Foundations of Cryptography February 8, 2013


AES

Feistel Networks

DES

Ideal Block Cipher

Perfect Secrecy

Information Theory



Advanced Encryption Standard (AES)

◮ Chosen in worldwide public competition 1998-2000.Probably no back-doors. Increased confidence!

◮ Winning proposal named “Rijndael”, by Rijmen and Daemen

◮ Family of 128-bit block ciphers:Key bits 128 192 256

Rounds 10 12 14

◮ The first key-recovery attacks on full AES due to Bogdanov,Khovratovich, and Rechberger, published 2011, is faster thanbrute force by a factor of about 4.

◮ ... algebraics of AES make some people uneasy.



AES

◮ AddRoundKey: XOR With Round Key

◮ SubBytes: Substitution

◮ ShiftRows: Permutation

◮ MixColumns: Linear Map



Similar to SPN

The 128 bit state is interpreted as a 4× 4 matix of bytes.

Something like a mix between substitution, permutation, affineversion of Hill cipher. In each round!



SubBytes

SubBytes is field inversion in F28 plus affine map in F82.



ShiftRows

ShiftRows is a cyclic shift of bytes with offset: 0, 1, 2, and 3.



MixColumns

MixColumns is an invertible linear map over F28 (with irreducibilepolynomial x8 + x

4 + x3 + x + 1) with good diffusion.



Decryption

Uses the following transformations:

◮ AddRoundKey

◮ InvSubBytes

◮ InvShiftRows

◮ InvMixColumns



Feistel Networks

◮ Identical rounds are iterated, but with different round keys.

◮ The input to the ith round is divided in a left and right part,denoted L

i−1 and Ri−1.

◮ f is a function for which it is somewhat hard to findpre-images, but f typically not neccessarily invertible!

◮ One round is defined by:

Li = R

i−1

Ri = L

i−1 ⊕ f (R i−1,K

i )

where Ki is the ith round key.



Feistel Round

Li−1left rightR

i−1

Ki



Feistel Round

Li−1left rightR

i−1

Ki

f



Feistel Round

Li−1left rightR

i−1

Ki

f

computeleftR

i



Feistel Round

Li−1left rightR

i−1

Ki

f

computeleftR

iLicopy right



Feistel Cipher



Inverse Feistel Round

Feistel Round.

Li = R

i−1

Ri = L

i−1 ⊕ f (R i−1,K

i )



Inverse Feistel Round

Feistel Round.

Li = R

i−1

Ri = L

i−1 ⊕ f (R i−1,K

i )

Inverse Feistel Round.

Li−1 = R

i ⊕ f (Li ,K i )

Ri−1 = L

i

Reverse direction and swap left and right!



Data Encryption Standard (DES)

◮ Developed at IBM in 1975, or perhaps...





◮ at National Security Agency (NSA). Nobody knows forcertain.






◮ 16-round Feistel network.







◮ Key schedule derives permuted bits for each round key from a56-bit key. Supposedly not 64-bit due to parity bits.







◮ Key schedule derives permuted bits for each round key from a56-bit key. Supposedly not 64-bit due to parity bits.

◮ Let us look a little at the Feistel-function f .



DES’ f -Function

Ri−132 bits

Ki

48 bits



DES’ f -Function

Ri−132 bits

E (R i−1)

E

48 bits

Ki

48 bits



DES’ f -Function

Ri−132 bits

E (R i−1)

E

48 bits

Ki

48 bits

B1 B2 B3 B4 B5 B6 B7 B8 48 bits



DES’ f -Function

Ri−132 bits

E (R i−1)

E

48 bits

Ki

48 bits

B1 B2 B3 B4 B5 B6 B7 B8 48 bits

c1 c2 c3 c4 c5 c6 c7 c8 32 bits

S1 S2 S3 S4 S5 S6 S7 S8



DES’ f -Function

Ri−132 bits

E (R i−1)

E

48 bits

Ki

48 bits

B1 B2 B3 B4 B5 B6 B7 B8 48 bits

c1 c2 c3 c4 c5 c6 c7 c8 32 bits

S1 S2 S3 S4 S5 S6 S7 S8

f (R i−1,K i )

P



Security of DES

◮ Brute Force. Try all 256 keys. Done in practice with specialchip by Electronic Frontier Foundation, 1998. Likely muchearlier by NSA and others.

◮ Differential Cryptanalysis. 247 chosen plaintexts, Biham andShamir, 1991. (approach: late 80’ies). Known earlier by IBMand NSA. DES is surprisingly resistant!

◮ Linear Cryptanalysis. 243 known plaintexts, Matsui, 1993.Probably not known by IBM and NSA!



Double DES

We have seen that the key space of DES is too small. One way toincrease it is to use DES twice, so called “double DES”.

2DESk1,k2(x) = DESk2(DESk1(x))

Is this more secure than DES?



Meet-In-the-Middle Attack

◮ Get hold of a plaintext-ciphertext pair (m, c)

◮ Compute X = {k1 ∈ KDES | c = Ek1(m)}.

◮ For k2 ∈ KDES check if E−1k2

(c) = Ek1(m), then (k1, k2) is a

good candidate.

◮ Repeat with (m′, c ′), starting from the set of candidate keysto identify correct key.



Triple DES

What about triple DES?

3DESk1,k2,k3(x) = DESk3(DESk2(DESk1(x)))

◮ Seemingly 112 bit “effective” key size.

◮ 3 times as slow as DES. DES is slow in software, and this iseven worse. One of the motivations of AES.



DESX

DESXDESXk1,k2,k3

(x) = k1 ⊕DESk3(x ⊕ k2)

◮ Seemingly stronger against brute-force attack.

◮ Not stronger against differential/linear cryptanalysis, since xoris linear.

◮ The use of the additional keys are called “whitening”.



Negligible Functions

Definition. A function ǫ(n) is negligible if for every constantc > 0, there exists a constant n0, such that

ǫ(n) <1

nc

for all n ≥ n0.

Motivation. Events happening with negligible probability can notbe exploited by polynomial time algorithms! (they “never” happen)



Pseudo-Random Function

“Definition”. A function is pseudo-random if no efficientadversary can distinguish between the function and a randomfunction.



Pseudo-Random Function

“Definition”. A function is pseudo-random if no efficientadversary can distinguish between the function and a randomfunction.

Definition. A family of functions F : {0, 1}k × {0, 1}n → {0, 1}n

is pseudo-random if for all polynomial time oracle adversaries A

∣

∣

∣

∣

PrK

[

AFK (·) = 1

]

− PrR:{0,1}n→{0,1}n

[

AR(·) = 1

]

∣

∣

∣

∣

is negligible.



Pseudo-Random Permutation

“Definition”. A permutation and its inverse is pseudo-random ifno efficient adversary can distinguish between the permutation andits inverse, and a random permutation and its inverse.



Pseudo-Random Permutation

“Definition”. A permutation and its inverse is pseudo-random ifno efficient adversary can distinguish between the permutation andits inverse, and a random permutation and its inverse.

Definition. A family of permutationsP : {0, 1}k × {0, 1}n → {0, 1}n are pseudo-random if for allpolynomial time oracle adversaries A

∣

∣

∣

∣

PrK

[

APK (·),P

−1K

(·) = 1]

− PrΠ∈S2n

[

AΠ(·),Π−1(·) = 1

]

∣

∣

∣

∣

is negligible, where S2n is the set of permutations of {0, 1}n .



Perfect Secrecy (1/3)

When is a cipher perfectly secure?




When is a cipher perfectly secure?

How should we formalize this?




Definition. A cryptosystem has perfect secrecy if guessing theplaintext is as hard to do given the ciphertext as it is without it.




Definition. A cryptosystem has perfect secrecy if guessing theplaintext is as hard to do given the ciphertext as it is without it.

Definition. A cryptosystem has perfect secrecy if

Pr [M = m |C = c ] = Pr [M = m]

for every m ∈ M and c ∈ C, where M and C are random variablestaking values overM and C.




Game Based Definition. ExpbA, where A is a strategy:

1. k←R K

2. (m0,m1)← A

3. c = Ek(mb)

4. d ← A(c), with d ∈ {0, 1}

5. Output d .

Definition. A cryptosystem has perfect secrecy if for everycomputationally unbounded strategy A,

Pr[

Exp0A = 1]

= Pr[

Exp1A = 1]

.



One-Time Pad

One-Time Pad (OTP).

◮ Key. Random tuple k = (b0, . . . , bn−1) ∈ Zn2.

◮ Encrypt. Plaintext m = (m0, . . . ,mn−1) ∈ Zn2 gives

ciphertext c = (c0, . . . , cn−1), where ci = mi ⊕ bi .

◮ Decrypt. Ciphertext c = (c0, . . . , cn−1) ∈ Zn2 gives plaintext

m = (m0, . . . ,mn−1), where mi = ci ⊕ bi .



Bayes’ Theorem

Theorem. If A and B are events and Pr[B ] > 0, then

Pr [A |B ] =Pr [A] Pr [B |A ]

Pr [B ]

Terminology:

Pr [A] – prior probability of APr [B ] – prior probability of BPr [A |B ] – posterior probability of A given B

Pr [B |A ] – posterior probability of B given A



One-Time Pad Has Perfect Secrecy

◮ Probabilistic Argument. Bayes implies that:

Pr [M = m |C = c ] =Pr [M = m] Pr [C = c |M = m ]

Pr [C = c]

= Pr [M = m]2−n

2−n

= Pr [M = m] .

◮ Simulation Argument. The ciphertext is uniformly andindependently distributed from the plaintext. We cansimulate it on our own!



Bad News

◮ “The key must be as long as the plaintext”:

◮ |K| ≥ |C|, since two ciphertexts can not be computed using thesame key.

◮ |C| ≥ |M|, since every plaintext must be encrypted in aninvertable way.

Theorem. “For every cipher with perfect secrecy, the keyrequires at least as much space to represent as the plaintext.”

◮ Dangerous in practice to rely on no reuse.



Information Theory

◮ Information theory is a mathematical theory ofcommunication.

◮ Typical questions studied are how to compress, transmit, andstore information.

◮ Information theory is also useful to argue about somecryptographic schemes and protocols.



Classical Information Theory

◮ Memoryless Source Over Finite Alphabet. A sourceproduces symbols from an alphabet Σ = {a1, . . . , an}. Eachgenerated symbol is identically and independently distributed.

◮ Binary Channel. A binary channel can (only) send bits.

◮ Coder/Decoder. Our goal is to come up with a scheme to:

1. convert a symbol a from the alphabet Σ into a sequence(b1, . . . , bl) of bits,

2. send the bits over the channel, and3. decode the sequence into a again at the receiving end.



Classical Information Theory

Enc Channel Decm m

Alice Bob



Optimization Goal

We want to minimize the expected number of bits/symbol wesend over the binary channel, i.e., if X is a random variable over Σand l(x) is the length of the codeword of x then we wish tominimize

E [l(X )] =∑

x∈Σ

PX (x) l(x) .



Examples:

◮ X takes values in Σ = {a, b, c , d} with uniform distribution.How would you encode this?



Examples:


It seems we need l(x) = log |Σ|. This gives the Hartley measure.



Examples:


◮ X takes values in Σ = {a, b, c}, with PX (a) = 12 , PX (b) = 1

4 ,and PX (c) = 1

4 . How would you encode this?

It seems we need l(x) = log |Σ|. This gives the Hartley measure.hmmm...



Examples:


◮ X takes values in Σ = {a, b, c}, with PX (a) = 12 , PX (b) = 1

4 ,and PX (c) = 1

4 . How would you encode this?

It seems we need l(x) = log 1PX (x)

bits to encode x .



Entropy

Let us turn this expression into a definition.

Definition. Let X be a random variable taking values in X . Thenthe entropy of X is

H(X ) = −∑

x∈X

PX (x) log PX (x) .

Examples and intuition are nice, but what we need is a theoremthat states that this is exactly the right expected length of anoptimal code.


lecture 3 aes, feistel networks, des, ideal block ciphers - kth

Documents