Title
A true random number generator using ring oscillators and SHA-256 as post-processing
Authors
[ 1 ] Katedra Systemów Telekomunikacyjnych i Optoelektroniki, Wydział Elektroniki i Telekomunikacji, Politechnika Poznańska | [ P ] employee
Year of publication
2014
Chapter type
paper
Publication language
english
Keywords
Abstract
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.
Pages (from - to)
1 - 4
Publication indexed in
WoS (15)
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS