Improving Key-Recovery in Linear Attacks - Application to 28-Round PRESENT

Improving Key-Recovery in Linear Attacks - Application to 28-Round PRESENT

TheIACR via YouTube Direct link

Introduction

1 of 16

1 of 16

Introduction

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

Improving Key-Recovery in Linear Attacks - Application to 28-Round PRESENT

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Introduction
  2. 2 Organisation
  3. 3 Matsui's Algorithm 2: Last-round attack
  4. 4 The work of Collard et al. (2008)
  5. 5 Main contribution: Generalised algorithm
  6. 6 Exploiting the key schedule
  7. 7 Walsh Transform pruning
  8. 8 The (affine) Pruned Walsh Transform
  9. 9 Combining correlations for multiple attacks
  10. 10 The PRESENT block cipher
  11. 11 Linear approximations of PRESENT
  12. 12 Linear distinguishers for PRESENT DISTINGUISHER 1 (used in 26,27-round attacks)
  13. 13 Example: Key recovery on 28-round PRESENT-80
  14. 14 Comparison of linear attacks on PRESENT
  15. 15 Summary of our results
  16. 16 Open problems

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.