A true random number generator using ring oscillators and SHA-256 as post-processing
[ 1 ] Katedra Systemów Telekomunikacyjnych i Optoelektroniki, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] pracownik
2014
referat
angielski
- true random number generation
- cryptography
- hash functions
- randomness and pseudo-randomness
- field-programmable gate array
EN In cryptography, we often require sequences of numbers with unpredictable elements. Such sequences have to pass all known statistical tests for random sequences, e.g. NIST 800-22 test suite, Diehard, TestU01 or UC1. To hamper different attacks, random number generators should be implemented in the same chip as a cryptographic system using random numbers. It forces a designer to create a true random number generator purely digitally. The obtained sequences are biased and do not pass many statistical tests. Therefore an output of the random number generator should be subjected to a transformation called post-processing. In this paper a true random number generator consisted of several uniformly sampled ring oscillators and using hash function SHA-256 as post-processing, is presented. Both components are implemented in a single Field Programmable Gate Array (FPGA). We expect that the proposed solution, implemented in the same FPGA together with a cryptographic system, is more attack-resistant owing to many sources of randomness with significantly different nominal frequencies.
1 - 4
WoS (15)