Skip to Main content Skip to Navigation

Analyse de primitives symétriques

Abstract : This thesis is about block ciphers and cryptographic hash functions, which are two essential primitives of symmetric-key cryptography. In the first part of this manuscript, we study useful building blocks for block cipher design. We first consider large diffusion matrices builtfrom algebraic-geometry codes, and then construct a small S-box with good diffusion. In the second case, we show how the S-box can be used to define a compact and efficient block cipher targetting small processors. In the second part, we focus on the SHA-1 hash function, for which we develop a free start collision attack. We show how classical collision attacks can be made more efficient by exploiting the additional freedom provided by the model. This allows us in particular to compute explicit collisions for the full compression function of SHA-1.
Document type :
Complete list of metadata

Cited literature [148 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Saturday, March 25, 2017 - 7:25:08 PM
Last modification on : Wednesday, November 3, 2021 - 6:13:21 AM
Long-term archiving on: : Monday, June 26, 2017 - 12:57:53 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01495634, version 1


Pierre Karpman. Analyse de primitives symétriques. Cryptographie et sécurité [cs.CR]. Université Paris Saclay (COmUE); Nanyang Technological University (Singapour), 2016. Français. ⟨NNT : 2016SACLX095⟩. ⟨tel-01495634⟩



Record views


Files downloads