Implementation and Testing of High-Speed CMOS True Random Number Generators Based on Chaotic Systems

被引:125
作者
Pareschi, Fabio [1 ,2 ]
Setti, Gianluca [1 ,2 ]
Rovatti, Riccardo [2 ,3 ]
机构
[1] Univ Ferrara, ENDIF, I-44100 Ferrara, Italy
[2] Univ Bologna, ARCES, I-40125 Bologna, Italy
[3] Univ Bologna, DEIS, I-40136 Bologna, Italy
关键词
Random number generators; pipeline analog-to-digital converters; chaotic map; cryptography; power analysis; randomness test; CRYPTOGRAPHIC APPLICATIONS; ESTIMATING ENTROPY;
D O I
10.1109/TCSI.2010.2052515
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We present the design and the validation by means of suitably improved randomness tests of two different implementations of high-performance true-random number generators which use a discrete-time chaotic circuit as their entropy source. The proposed system has been developed from a standard pipeline Analog-to-Digital converter (ADC) design, modified to operate as a set of piecewise-linear chaotic maps. The evolution of each map is observed and quantized to obtain a random bit stream. With this approach it is possible to obtain, on current CMOS technology, a data rate in the order of tens of megabit per second. Furthermore, we can also prove that the design is tamper resistant in the sense that a power analysis cannot leak information regarding the generated bits. This makes the proposed circuit perfectly suitable for embedding in cryptographic systems like smarts cards, even more so if one consider that it could be easily obtained by reconfiguring an existing pipeline ADC. The two prototypes have been designed in a 0.35-mu m and 0.18-mu m CMOS technology, and have a throughput of, respectively, 40 Mbit/s and 100 Mbit/s. A comparison between measured results and other high-end commercial solutions shows a comparable quality with a operating speed that is one order of magnitude faster.
引用
收藏
页码:3124 / 3137
页数:14
相关论文
共 57 条
[31]  
Marsaglia G, MARSAGLIA RANDOM NUM
[32]  
Menezes A., 1996, HDB APPL CRYPTOGRAPH
[33]  
*NIST, 2001, FED INF PROC STAND F, V1402
[34]  
*NIST, RAND NUMB GEN TEST
[35]  
*NIST, 2001, SPEC PUBL NAT I STAN
[36]   Estimating entropy on m bins given fewer than m samples [J].
Paninski, L .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (09) :2200-2203
[37]  
PARESCHI F, P ISCAS 2007 NEW ORL, P1437
[38]  
PARESCHI F, 2006, P 2006 INT S NONL TH, P383
[39]  
PARESCHI F, P 2009 INT S CIRC SY, P2858
[40]  
PARESCHI F, IEEE T CIRC IN PRESS, DOI DOI 10.1109/TCSI.2010.204877