# Mathématiques discrètes appliquées à la cryptographie symétrique

Abstract : In this thesis, we study the security of symmetric cryptographic primitives. These systems are based on transformations relying on mathematical objects that can be represented in multiple ways. We then exploit different induced structures to highlight new vulnerabilities. By exploiting various representations, we cryptanalyzed some schemes submitted to the CAESAR competition, and also some dedicated and generic stream ciphers. We exhibited design criteria for lightweight block ciphers in view of the NIST standardization process and in the case of stream ciphers we defined new cryptographic criteria more relevant than the usual ones. More precisely, we study the security of lightweight block ciphers with respect to the recent invariant attacks, and we show how to avoid them with an appropriate choice of the linear layer and the round constants. We propose a new cryptanalysis of the filtered registers, by decomposing elements in the multiplicative subgroups of the finite field with 2^n elements. The analysis of the FLIP cipher, but also of the Goldreich pseudo-random generator, revealed weaknesses that are exploitable in guess and determine'' attacks. This leads to new criteria on the Boolean functions used in this context. Finally, we cryptanalyze a weaker version of the authenticated encryption scheme Ketje using several techniques, in order to refine the security evaluation of this cipher.
Keywords :
Document type :
Theses
Domain :

https://hal.inria.fr/tel-01944827
Contributor : Yann Rotella <>
Submitted on : Tuesday, December 4, 2018 - 9:46:29 PM
Last modification on : Tuesday, November 12, 2019 - 4:43:15 PM

### File

these_archivage_3570230.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : tel-01944827, version 1

### Citation

Yann Rotella. Mathématiques discrètes appliquées à la cryptographie symétrique. Informatique [cs]. Sorbonne Université, 2018. Français. ⟨tel-01944827v1⟩

Record views