Analyse et conception de fonctions de hachage cryptographiques

Abstract : A hash function is a function taking as argument an element of finite arbitrary length and returning an element of fixed length. There are different types of hash functions that correspond to fields of use. Among these functions, cryptographic hash functions are distinguished by the variety of missions assigned to them and requiring them to meet many security requirements. Cryptographic hash functions commonly used in practices belong to the MD-SHA family, whose most-known members are MD5 and SHA-1. In recent years, new crytptanalysis techniques have emerged. These techniques, although very complex, have proved so successful that it led to the abandonment of the use of MD5 and SHA-1, and to the openning of an international competition to develop a new cryptographic hash algorithm. The research we conducted as part of this thesis stand in both process analysis and design. We study the new advances in the cryptanalysis of hash functions, particularly their implementation within the functions SHA-0 and SHA-1. We present as such the best practical attack known against SHA-0 and propose the first classification of disturbances vectors used by collision attacks against SHA-1. We then discuss the design of new functions through XOR-Hash and FSB.
Document type :
Theses
Complete list of metadatas

https://pastel.archives-ouvertes.fr/pastel-00573346
Contributor : Stéphane Manuel <>
Submitted on : Thursday, March 3, 2011 - 2:44:35 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on : Saturday, June 4, 2011 - 2:33:06 AM

Identifiers

  • HAL Id : pastel-00573346, version 1

Collections

Citation

Stéphane Manuel. Analyse et conception de fonctions de hachage cryptographiques. Informatique. Ecole Polytechnique X, 2010. Français. ⟨pastel-00573346⟩

Share

Metrics

Record views

1399

Files downloads

2983