Résumé

Partie 1 : On Boolean functions and non-linearity

Présenté par Max SALA (Univ. Trento)

We review some notions of non-linearity for Boolean functions and their relation to cryptography. In particular, we present some new notions and we show their significance.

Partie 2 : On the non-random action of AES encryptions

Présenté par Anna RIMOLDI (Univ. Trento)

We show an algebraic embedding that apparently reveals a non-random behavious for AES encryptions.

Our embedding is designed to lower the non-linearity of the AES rounds.

We describe our distinguisher, that needs 223 pairs and costs 248 encryptions.