There is a newer version of the record available.

Published October 31, 2020 | Version v1
Journal article

A fully CMOS true random number generator based on hidden attractor hyperchaotic system

  • 1. University of Québec. Department of Electrical Engineering, École de Technologie Supérieure (ÉTS) (Canada)
  • 2. University of Bologna. Advanced Research Center on Electronic Systems (ARCES) (Italy)
  • 3. Department of Electronics and Telecommunications (Italy)
  • 4. University of Bologna. Department of Electrical, Electronic, and Information Engineering (Italy)

Description

Low-power devices used in Internet-of-things networks have been short of security due to the high power consumption of random number generators. This paper presents a low-power hyperchaos-based true random number generator, which is highly recommended for secure communications. The proposed system, which is based on a four-dimensional chaotic system with hidden attractors and oscillators, exhibits rich dynamics. Numerical analysis is provided to verify the dynamic characteristics of the proposed system. A fully customized circuit is deployed using 130 nm CMOS technology to enable integration into low-power devices. Four output signals are used to seed a SHIFT-XOR-based chaotic data post-processing to generate random bit output. The chip prototype was simulated and tested at 100 MHz sampling frequency. The hyperchaotic circuit consumes a maximum of 980 μW in generating chaotic signals while dissipates a static current of 623 μA. Moreover, the proposed system provides ready-to-use binary random bit sequences which have passed the well-known statistical randomness test suite NIST SP800-22. The proposed novel system design and its circuit implementation provide a best energy efficiency of 4.37 pJ/b at a maximum sampling frequency of 100 MHz.

Additional details

Identifiers

Publishing Information

Journal Title
Nonlinear Dynamics
Journal Volume
102
Journal Issue
4
Journal Page Range
p. 2887-2904
ISSN
0924-090X

Optional Information

Copyright
Copyright (c) 2020 © The Author(s) 2020