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 :
Theses
Complete list of metadatas

Cited literature [148 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/tel-01495634
Contributor : Abes Star <>
Submitted on : Saturday, March 25, 2017 - 7:25:08 PM
Last modification on : Wednesday, April 17, 2019 - 1:32:48 AM
Long-term archiving on : Monday, June 26, 2017 - 12:57:53 PM

File

61347_KARPMAN_2016_archivage.p...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01495634, version 1

Citation

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

Share

Metrics

Record views

1265

Files downloads

660