Embedded Cryptography 2 - Colin O'Flynn

. .

Résumé :

Preface xiii
Emmanuel PROUFF, Gu?na?l RENAULT, Matthieu RIVAIN and Colin O'FLYNN

Part 1 Masking 1

Chapter 1 Introduction to Masking 3
Ange MARTINELLI and M?lissa ROSSI

1.1. An overview of masking 3

1.2. The effect of masking on side-channel leakage 4

1.3. Different types of masking 5

1.4. Code-based masking: toward a generic framework 8

1.5. Hybrid masking 10

1.6. Examples of specific maskings 11

1.7. Outline of the part 12

1.8. Notes and further references 13

1.9. References 13

Chapter 2 Masking Schemes 15
Jean-S?bastien CORON and Rina ZEITOUN

2.1. Introduction to masking operations 15

2.2. Classical linear operations 15

2.3. Classical nonlinear operations 16

2.3.1 Application of ISW algorithm for n =2and n =3 17

2.4. Mask refreshing 18

2.4.1 Refresh masks with complexity O(n) 18

2.4.2 Refresh masks with complexity O(n 2) 18

2.4.3 Refresh masks with complexity O(n ? log n) 19

2.5. Masking S-boxes 21

2.5.1. The Rivain-Prouff countermeasure for AES 21

2.5.2. Extension to any S-box 22

2.5.3. The randomized table countermeasure 23

2.5.4. Attacks 24

2.6. Masks conversions 27

2.6.1. First-order Boolean to arithmetic masking 27

2.6.2. Generalization to high order for Boolean to arithmetic masking 28

2.6.3. High order Boolean to arithmetic and arithmetic to Boolean masking 30

2.7. Notes and further references 35

2.8. References 37

Chapter 3 Hardware Masking 39
Beg?l BILGIN and Lauren DE MEYER

3.1. Introduction 39

3.1.1. Glitches 40

3.1.2. Glitch-extended probes 41

3.1.3. Non-completeness 41

3.2. Category I: td +1masking 42

3.2.1. First-order security 43

3.2.2. Higher-order security 46

3.3. Category II: d +1masking 46

3.3.1. General construction 47

3.3.2. Security argument 48

3.3.3. Comparing to td +1masking 49

3.3.4. Higher-degree functions 50

3.4. Trade-offs 51

3.4.1. Minimizing area 52

3.4.2. Minimizing latency 52

3.4.3. Minimizing randomness 53

3.5. Notes and further references 53

3.6. References 55

Chapter 4 Masking Security Proofs 59
Sonia BELA?D

4.1. Introduction 59

4.2. Preliminaries 60

4.2.1. Circuits 60

4.2.2. Additive sharings and gadgets 61

4.2.3. Compilers 61

4.3. Probing model 62

4.3.1. Formal definition 62

4.3.2. Proofs for small gadgets 63

4.3.3. Simulation-based proofs 64

4.3.4. Limitations 66

4.4. Robust probing model 67

4.4.1. Formal definition 67

4.4.2. Proofs for small gadgets 68

4.4.3. Limitations 69

4.5. Random probing model and noisy leakage model 70

4.5.1. Formal definition of the noisy leakage model 70

4.5.2. Limitations 70

4.5.3. Reduction to the probing model 71

4.5.4. Formal definition of the random probing model 71

4.5.5. Proofs in the random probing model 72

4.5.6. Extension to handle physical defaults 73

4.6. Composition 74

4.6.1. Composition in the probing model 74

4.6.2. Composition in the random probing model 77

4.7. Conclusion 81

4.8. Notes and further references 81

4.9. References 81

Chapter 5 Masking Verification 83
Abdul Rahman TALEB

5.1. Introduction 83

5.2. General procedure 84

5.3. Verify: verification mechanisms for a set of variables 87

5.3.1 Distribution-based Verify 87

5.3.2 Simulation-based Verify 90<...