Arithmetic operators for on-the-fly evaluation of TRNGs

Many cryptosystems embed a high-quality true random number generator (TRNG). The randomness quality of a TRNG output stream depends on its implementation and may vary due to various changes in the environment such as power supply, temperature, electromagnetic interferences. Attacking TRNGs may be a good solution to decrease the security of a cryptosystem leading to lower security keys or bad padding values for instance. In order to protect TRNGs, on-the-fly evaluation of their randomness quality must be integrated on the chip. In this paper, we present some preliminary results of the FPGA implementation of functional units dedicated to statistical tests for on-the-fly randomness evaluation. In the entropy test the evaluation of the harmonic series at some ranks is required. Usually its approximation is costly. We propose a multiple interval polynomial approximation. The decomposition of the whole domain into small sub-intervals leads to a good trade-off between the degree of the polynomial (i.e. multipliers cost) and the memory resources required to store the coefficients for all sub-intervals.

[1]  Ueli Maurer,et al.  A universal statistical test for random bit generators , 1990, Journal of Cryptology.

[2]  M. Villarino Ramanujan's Harmonic Number Expansion into Negative Powers of a Triangular Number , 2007, 0707.3950.

[3]  Jean-Sébastien Coron,et al.  On the Security of Random Sources , 1999, Public Key Cryptography.

[4]  Jean-Sébastien Coron,et al.  An Accurate Evaluation of Maurer's Universal Test , 1998, Selected Areas in Cryptography.

[5]  Olivier Sentieys,et al.  On-the-Fly Evaluation of FPGA-Based True Random Number Generator , 2009, 2009 IEEE Computer Society Annual Symposium on VLSI.

[6]  Olivier Sentieys,et al.  On-line monitoring of Random Number Generators for embedded security , 2009, 2009 IEEE International Symposium on Circuits and Systems.

[7]  Arnaud Tisserand High-performance hardware operators for polynomial evaluation , 2007, Int. J. High Perform. Syst. Archit..

[8]  Wayne Luk,et al.  Hierarchical segmentation schemes for function evaluation , 2003, Proceedings. 2003 IEEE International Conference on Field-Programmable Technology (FPT) (IEEE Cat. No.03EX798).

[9]  Werner Schindler,et al.  Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic Applications , 2002, CHES.

[10]  Duane W. DeTemple,et al.  Half integer approximations for the partial sums of the harmonic series , 1991 .

[11]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[12]  Arnaud Tisserand,et al.  Hardware operators for function evaluation using sparse-coefficient polynomials , 2006 .

[13]  Arnaud Tisserand,et al.  Computing machine-efficient polynomial approximations , 2006, TOMS.

[14]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[15]  W. Killmann,et al.  A proposal for : Functionality classes and evaluation methodology for true ( physical ) random number generators , 2002 .

[16]  Milos D. Ercegovac,et al.  Digital Arithmetic , 2003, Wiley Encyclopedia of Computer Science and Engineering.

[17]  Jean-Michel Muller,et al.  Elementary Functions: Algorithms and Implementation , 1997 .

[18]  Young-Sik Kim,et al.  Fast Digital TRNG Based on Metastable Ring Oscillator , 2008, CHES.

[19]  William M. Daley,et al.  Security Requirements for Cryptographic Modules , 1999 .