Looking for suitable rules for true random number generation with asynchronous cellular automata

被引:0
作者
A. Cicuttin
L. De Micco
M. L. Crespo
M. Antonelli
L. Garcia
W. Florian Samayoa
A. Silva
机构
[1] International Centre for Theoretical Physics (ICTP),Multidisciplinary Laboratory
[2] Università degli Studi di Trieste,Department of Engineering and Architecture
[3] Universidad Nacional de Mar del Plata (UNMDP) – CONICET,Instituto de Investigaciones Científicas y Tecnológicas en Electrónica (ICyTE), Facultad de Ingeniería
来源
Nonlinear Dynamics | 2023年 / 111卷
关键词
Asynchronous cellular automata; Boolean functions; Nonlinear dynamics; Rules; Complexity; Chaos; True random number generation; Digital design;
D O I
暂无
中图分类号
学科分类号
摘要
Achieving true random behavior in digital systems represents both a challenge and an opportunity for high-performance true random number generation (TRNG). Asynchronous cellular automata (ACA) are interesting candidates for reconfigurable hardware implementations, but one of its main problems is the identification of the best rules for performance and quality. In this article, we propose an analytical approach to evaluate and select suitable rules for TRNG with physical implementations of ACA networks. We introduce the concept of rule reactivity as an indicator of the expected ACA average transition rate. We also propose the concept of rule disequilibrium function for probabilistic estimation of the ACA output balance. Based on these analytic tools, it is possible to identify the best rules for ACA with any number of inputs.
引用
收藏
页码:2711 / 2722
页数:11
相关论文
共 26 条
  • [1] Cicuttin A(2021)Physical implementation of asynchronous cellular automata networks: mathematical models and preliminary experimental results Nonlinear Dyn. 105 2431-undefined
  • [2] De Micco L(1999)Generating high-quality random numbers in parallel by cellular automata Futur. Gener. Comput. Syst. 16 291-undefined
  • [3] Crespo M(2004)Cellular automata computations and secret key cryptography Parallel Comput. 30 753-undefined
  • [4] Antonelli M(1999)Synchronous and asynchronous updating in cellular automata Biosystems 51 123-undefined
  • [5] Garcia L(2006)Fully asynchronous behavior of double-quiescent elementary cellular automata Theoret. Comput. Sci. 362 1-undefined
  • [6] Florian W(2020)A tutorial on elementary cellular automata with fully asynchronous updating Nat. Comput. 19 179-undefined
  • [7] Tomassini M(2012)Sampling period, statistical complexity, and chaotic attractors Physica A 391 2564-undefined
  • [8] Sipper M(1986)Random sequence generation by cellular automata Adv. Appl. Math. 7 123-undefined
  • [9] Zolla M(undefined)undefined undefined undefined undefined-undefined
  • [10] Perrenoud M(undefined)undefined undefined undefined undefined-undefined