Links Between Theoretical and Effective Differential Probabilities: Experiments on PRESENT

Transcription

1 Links Between Theoretical and Effective Differential Probabilities: Experiments on PRESENT Céline Blondeau, Benoît Gérard SECRET-Project-Team, INRIA, France TOOLS for Cryptanalysis - 23th June 2010 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 1 / 24

2 Outline 1 Introduction 2 Differential Trails 3 Differential 4 Success Probability C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 2 / 24

3 Outline 1 Introduction 2 Differential Trails 3 Differential 4 Success Probability C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 3 / 24

4 Notation We consider iterative block ciphers (especially PRESENT) operating on m-bit messages; using a master key K; with round function F using subkeys K i ; Y def = Enc K (X) def = F Kr F Kr 1 F K1 (X). We focus on the particular case of key alternating ciphers. C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 4 / 24

5 Differential A r-round differential of a cipher is a couple (δ 0, δ r ) F m 2 F m 2. The probability of a r-round differential is p def = Pr X,K [Enc K (X) Enc K (X δ 0 ) = δ r ]. If p > 2 m, then we can distinguish F r K from a random permutation. Statistical Cryptanalysis. C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 5 / 24

6 PRESENT A 64-bit block cipher presented in [Bogdanov et al., CHES 2007]. 80-bit or 128-bit key schedule. Substitution Permutation Network (SPN). A single 4-bit Sbox. S15 S14 S13 S12 S11 S10 S9 S8 S7 S6 S5 S4 S3 S2 S1 S0 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 6 / 24

7 SMALLPRESENT-[s] Proposed by Leander in s is the number of Sboxes thus SMALLPRESENT-[s] is a 4s-bit cipher. The permutation is similar to the one of PRESENT. 80-bit key schedule. All of the experiments but one are done on SMALLPRESENT-[4]. One round of SMALLPRESENT-[4]. S3 S2 S1 S0 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 7 / 24

8 Key schedules We introduced 2 other key schedules: a 16-bit key schedule (all subkeys are equal). a 20-bit key schedule (similar to the 80-bit one): Master key: K = k 19 k 18...k 0. Round keys: K i = k 19 k 18...k 4. Updated as follows: 1 [k 19k k 1k 0] = [k 6k 5... k 8k 7]; 2 [k 19k 18k 17k 16] = S[k 19k 18k 17k 16]; 3 [k 7k 6k 5k 4k 3] = [k 7k 6k 5k 4k 3] roundcounter. In this presentation, shown results are obtained using this last one. C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 8 / 24

9 Outline 1 Introduction 2 Differential Trails 3 Differential 4 Success Probability C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 9 / 24

10 Differential trails A differential trail of a cipher is a (r + 1)-tuple (β 0, β 1,, β r ) (F m 2 )r+1 of intermediate differences. The probability p β of a differential trail β = (β 0, β 1,, β r ) is: p β def = Pr X,K [ i F i K (X) F i K (X β 0) = β i ]. If the cipher is Markov and the round subkeys are independent, then, p t β def = r Pr X [F(X) F(X β i 1 ) = β i ]. i=1 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 10 / 24

11 Key dependency (1/3) For a differential trail β: T K def = 1 2 # { X F i K (X) F i K (X β 0) = β i, 1 i r }, p β = 2 (m 1) E(T K ). S3 S2 S1 S0 S3 S2 S1 S0 S3 S2 S1 S0 T K # p β = 10 2 (16 1). p t β = 8 2 (16 1) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 11 / 24

12 Key dependency (2/3) p t β = 2 17 p t β = 2 20 p t β = 2 23 p t β = log 2 (p β ) log 2 (p t β) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 12 / 24

13 Key dependency (3/3) p t β = 2 17 p t β = 2 20 p t β = 2 23 p t β = log 2 (3/4) log 2 (p β ) log 2 (pβ) t log 2 (5/4) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 13 / 24

14 Outline 1 Introduction 2 Differential Trails 3 Differential 4 Success Probability C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 14 / 24

15 Differential probability 0 log 2 ( p t β ) log 2(p ) The probability p of a r-round differential (δ 0, δ r ) is p = p β. β=(δ 0,β 1,...,β r 1,δ r) log 2 (number of trails) Algorithm used: adaptation of [Biryukov et al., CRYPTO 2004]. C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 15 / 24

16 Remarks on [Wang, AFRICACRYPT 2008] Attack: 14-round differentials with probability (lower bounded by) Obtained by iterating 3 times a 4-round differential trail. Remarks: 2 62 is the best probability for a 14-round differential trail. Considering the best trails of the difference (pβ t 2 73 ). -57 p t = log 2 ( p t β ) log 2 (number of trails) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 16 / 24

17 Key dependency [Daemen, Rijmen 2005] In the Sampling Model for key-alternating ciphers, variable D K follows a binomial distribution. D K def = 1 2 #{X F r K (X) F r K (X δ 0) = δ r } Plots for 5-round differentials of SMALLPRESENT-[4] C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 17 / 24

18 Outline 1 Introduction 2 Differential Trails 3 Differential 4 Success Probability C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 18 / 24

19 Success Probability (1/2) p def = Pr X,K [Enc K (X) Enc K (X δ 0 ) = δ r ]. The function P S (p) is the success probability of an attack with a fixed-key differential probability p. The new formula for the Success Probability that takes into account the sampling model is: P success [ ( )] def DK = E DK P S 2 m 1 2 m 1 ( ) [ i = P S (p ) i (1 p ) 2m 1 i i=0 2 m 1 ( 2 m 1 i )].(1) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 19 / 24

20 Success Probability (2/2) Experimental P S ( ) (1) Differential attack, SMALLPRESENT-[8], 11 rounds, 2 32 keys, 2 9 keys tried, 100 experiments log 2 (N) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 20 / 24

21 Success Probability: choice of P S (1/2) [Selçuk, Journal of Cryptology 2007] P S Φ 1 (1 l n ) φ 0 (t) dt. [Blondeau, Gérard and Tillich, to appear in DCC] P S N i=f 1 (1 l 1 n 2) In the case of differential cryptanalysis, P[X 0 = i]. THE SECOND ONE IS TIGHTER!!! C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 21 / 24

22 Success Probability: choice of P S (2/2) PS Experimental [BGT10] [BGT10]+(1) log 2 (N) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 22 / 24

23 Success Probability: choice of P S (2/2) PS Experimental [BGT10] [BGT10]+(1) [Sel07]+(1) log 2 (N) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 22 / 24

24 Recommendations Use more than one trail when estimating a differential probability. For Wang s differential : p β : 10s. p β : 2m. p β : 1h. p β : 16h. Use the success probability formula given in this talk together with the one in [BGT10] PS Experimental [BGT10] [BGT10]+(1) [Sel07]+(1) log 2 (N) C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 23 / 24

25 Conclusion and further work For most of the trails p t β seems to be a good estimate for p β. Although p t β can be different from p β, it seems that p t β p. The Sampling Model seems to be well suited at least in the case of SMALLPRESENT-[4] and SMALLPRESENT-[8]. This leads to a new formula for the success probability of a differential attack. Results are obtained on SMALLPRESENT-[4] Trying to run experiments on SMALLPRESENT-[8] to extrapolate on the full PRESENT. Running experiments on other SPNs or Feistel networks. C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 24 / 24

26 Explanation on the 3-round trail S3 S2 S1 S0 S3 S2 S1 S0 S3 S2 S1 S0 0x1 0x3 implies red bits to 0. 0x3 0x6 implies green bit to 1. Two green key bits correspond to the same master key bit. Key bits Probability of 1 1/2 1/2 1/2 1 Key bits Probability of 1 1 1/2 1 0 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 25 / 24

27 Finding differential trails Finding trails with probability > 10/2 6. 0x1 0x2 0x3 0x2 0x3 0x1 0x4 0x2 0x3 0x1 0x4 0x2 0x3 0x1 0x3 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24

28 Finding differential trails Finding trails with probability > 10/2 6. 0x1 1/2 2 3/2 2 2/2 4 2/2 4 3/2 4 9/2 4 4/2 6 4/2 6 2/2 6 6/2 6 1/2 6 9/2 6 18/2 6 18/2 6 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24

29 Finding differential trails Finding trails with probability > 10/2 6. 0x1 1/2 2 3/2 2 2/2 4 2/2 4 3/2 4 9/2 4 4/2 6 4/2 6 2/2 6 6/2 6 1/2 6 9/2 6 18/2 6 18/2 6 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24

30 Finding differential trails Finding trails with probability > 10/2 6. 0x1 1/2 2 3/2 2 2/2 4 2/2 4 3/2 4 9/2 4 4/2 6 4/2 6 2/2 6 6/2 6 1/2 6 9/2 6 18/2 6 18/2 6 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24

31 Finding differential trails Finding trails with probability > 10/2 6. 0x1 1/2 2 3/2 2 2/2 4 2/2 4 3/2 4 9/2 4 4/2 6 4/2 6 2/2 6 6/2 6 1/2 6 9/2 6 18/2 6 18/2 6 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24

32 Finding differential trails Finding trails with probability > 10/2 6. 0x1 1/2 2 3/2 2 2/2 4 2/2 4 3/2 4 9/2 4 4/2 6 4/2 6 2/2 6 6/2 6 1/2 6 9/2 6 18/2 6 18/2 6 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24

33 Finding differential trails Finding trails with probability > 10/2 6. 0x1 1/2 2 3/2 2 2/2 4 2/2 4 3/2 4 9/2 4 4/2 6 4/2 6 2/2 6 6/2 6 1/2 6 9/2 6 18/2 6 18/2 6 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24

34 Finding differential trails Finding trails with probability > 10/2 6. 0x1 1/2 2 3/2 2 2/2 4 2/2 4 3/2 4 9/2 4 4/2 6 4/2 6 2/2 6 6/2 6 1/2 6 9/2 6 18/2 6 18/2 6 C.Blondeau and B.Gérard. Links Between Theoretical and Effective Differential Probabilities 26 / 24