Analyse d'accumulateurs d'entropie pour les générateurs aléatoires cryptographiques

Abstract : While random numbers are frequently used in cryptography (seed, token, ...), news regurlarly prove how bad randomness generation can compromise the wole security of a protocol. Random number generators for crypthography are components with three steps : a source (an algorithm or physical phenomenon) produces raw numbers which are two times postprocessed to fix anomalies. This thesis focuses on the analysis of physical random bit generators in order to extract postprocessing which will be adapted to the anomalies of the source. As the design of a physical random bit generator is complex, its evaluation is mainly a statistical analysis with hypothesis testing. However, the current standards (AIS31, FIPS140-2, Test U01, SP800) can not provide informations to characterize anomalies. Thus, this thesis adjust several tests and add a time analysis to identify and to make global and local anomalies explicit. A C library was developped, providing anomalies simulator and tools to apply statistical and time analysis results on random bit generators.
Document type :
Complete list of metadatas
Contributor : Guenaëlle de Julis <>
Submitted on : Tuesday, January 13, 2015 - 2:39:51 PM
Last modification on : Monday, April 30, 2018 - 3:02:01 PM
Long-term archiving on : Tuesday, April 14, 2015 - 10:56:22 AM


  • HAL Id : tel-01102765, version 1



Guenaëlle de Julis. Analyse d'accumulateurs d'entropie pour les générateurs aléatoires cryptographiques. Mathématiques [math]. ED MSTII, 2014. Français. ⟨tel-01102765⟩



Record views


Files downloads