A Performance Metric for Discrete-Time Chaos-Based Truly Random Number\n Generators

2012/01/10 by Ahmad Beirami, Beirami, Ahmad, Hamid Reza Nejati +3
Computer Science · #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #Dynamical Systems (math.DS) #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.1201.2201

openalex publication_date 2012/01/10 · openalex created_date 2022/09/28 · openalex updated_date 2026/07/28

Abstract

In this paper, we develop an information entropy based metric that represents\nthe statistical quality of the generated binary sequence in Truly Random Number\nGenerators (TRNG). The metric can be used for the design and optimization of\nthe TRNG circuits as well as the development of efficient post-processing units\nfor recovering the degraded statistical characteristics of the signal due to\nprocess variations.\n

Related

• A Framework for Investigating the Performance of Chaotic-Map Truly Random Number Generators
• Discrete-Time Chaotic-Map Truly Random Number Generators: Design, Implementation, and Variability Analysis of the Zigzag Map
• Entropy Mixing Networks: Enhancing Pseudo-Random Number Generators with Lightweight Dynamic Entropy Injection
• Truly random number generation via entropy amplification
• A Pseudo Random Number Generator from Chaos