Hardware implementation of a pseudo random number generator based on chaotic iteration

Abstract : Security and cryptography are key elements in constrained devices such as IoT, smart card, embedded system, etc. Their hardware implementations represent a challenge in terms of limitations in physical resources, operating speed, memory capacity, etc. In this context, as most protocols rely on the security of a good random number generator, considered an indispensable element in lightweight security core. Therefore, this work proposes new pseudo-random generators based on chaotic iterations, and designed to be deployed on hardware support, namely FPGA or ASIC. These hardware implementations can be described as post-processing on existing generators. They transform a sequence of numbers not uniform into another sequence of numbers uniform. The dependency between input and output has been proven chaotic, according notably to the mathematical definitions of chaos provided by Devaney and Li-Yorke. Following that, we firstly elaborate or develop out a complete state of the art of the material and physical implementations of pseudo-random number generators (PRNG, for pseudorandom number generators). We then propose new generators based on chaotic iterations (IC) which will be tested on our hardware platform. The initial idea was to start from the n-cube (or, in an equivalent way, the vectorial negation in CIs), then remove a Hamiltonian cycle balanced enough to produce new functions to be iterated, for which is added permutation on output . The methods recommended to find good functions, will be detailed, and the whole will be implemented on our FPGA platform. The resulting generators generally have a better statistical profiles than its inputs, while operating at a high speed. Finally, we will implement them on many hardware support (65-nm ASIC circuit and Zynq FPGA platform).
Document type :
Theses
Complete list of metadatas

Cited literature [223 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02080150
Contributor : Abes Star <>
Submitted on : Tuesday, March 26, 2019 - 3:01:27 PM
Last modification on : Wednesday, March 27, 2019 - 1:18:34 AM
Long-term archiving on: Thursday, June 27, 2019 - 5:09:42 PM

File

these_A_BAKIRI_Mohammed_2018.p...
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02080150, version 1

Citation

Mohammed Bakiri. Hardware implementation of a pseudo random number generator based on chaotic iteration. Cryptography and Security [cs.CR]. Université Bourgogne Franche-Comté, 2018. English. ⟨NNT : 2018UBFCD014⟩. ⟨tel-02080150⟩

Share

Metrics

Record views

68

Files downloads

135