Skip to main content
SpringerLink
Log in

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

  • Original Paper
  • Published:
Nonlinear Dynamics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Data availability

The datasets generated during and/or analyzed during the current study are available from the corresponding author on reasonable request.

References

  1. Mechalas, J.P.: Intel®Digital Random Number Generator (DRNG) Software Implementation Guide. Intel®(2018)

  2. Communications in Nonlinear Science and Numerical Simulation 43, 139 (2017). https://doi.org/10.1016/j.cnsns.2016.05.002

  3. Cicuttin, A., De Micco, L., Crespo, M., Antonelli, M., Garcia, L., Florian, W.: Physical implementation of asynchronous cellular automata networks: mathematical models and preliminary experimental results. Nonlinear Dyn. 105(3), 2431 (2021)

    Article  Google Scholar 

  4. Ilachinski, A.: Cellular Automata: a Discrete Universe. World Scientific Publishing Company, Singapore (2001)

    Book  MATH  Google Scholar 

  5. Dömösi, P., Nehaniv, C.L.: Algebraic Theory of Automata Networks: An Introduction. SIAM, New Delhi (2005)

    Book  MATH  Google Scholar 

  6. Ping, P., Xu, F., Wang, Z.J.: In Generating high-quality random numbers by next nearest-neighbor cellular automata. Advanced Materials Research, vol. 765 (Trans Tech Publ, 2013), vol. 765, pp. 1200–1204

  7. Tomassini, M., Sipper, M., Zolla, M., Perrenoud, M.: Generating high-quality random numbers in parallel by cellular automata. Futur. Gener. Comput. Syst. 16(2–3), 291 (1999)

    Article  Google Scholar 

  8. Szaban, M., Seredynski, F., Bouvry, P.: Collective behavior of rules for cellular automata-based stream ciphers. In: 2006 IEEE International Conference on Evolutionary Computation. IEEE, pp. 179–183 (2006)

  9. Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular automata computations and secret key cryptography. Parallel Comput. 30(5–6), 753 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  10. Bilan, S.: Pseudorandom Number Generators Based on Asynchronous Cellular Automata. IGI Global, Pennsylvania (2017)

    Google Scholar 

  11. Schönfisch, B., de Roos, A.: Synchronous and asynchronous updating in cellular automata. Biosystems 51(3), 123 (1999)

    Article  Google Scholar 

  12. Fates, N., Thierry, É., Morvan, M., Schabanel, N.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theoret. Comput. Sci. 362(1–3), 1 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fatès, N.: A tutorial on elementary cellular automata with fully asynchronous updating. Nat. Comput. 19(1), 179 (2020)

    Article  MathSciNet  Google Scholar 

  14. De Micco, L., Fernández, J.G., Larrondo, H.A., Plastino, A., Rosso, O.A.: Sampling period, statistical complexity, and chaotic attractors. Physica A 391(8), 2564 (2012)

    Article  Google Scholar 

  15. Sloane, N.J.: et al. The on-line encyclopedia of integer sequences. OEIS Foundation Inc (2003). http://oeis.org

  16. Wolfram MathWorld thue-morse sequence. https://mathworld.wolfram.com/Thue-MorseSequence.html. Accessed 02 Mar 2022

  17. Wolfram, S.: Random sequence generation by cellular automata. Adv. Appl. Math. 7(2), 123 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  18. Betel, H., de Oliveira, P.P., Flocchini, P.: On the parity problem in one-dimensional cellular automata. arXiv:1208.2758 (2012)

Download references

Acknowledgements

This work was partially supported by the ICTP Associates and STEP programs, the ICTP Multidisciplinary Laboratory, the CONICET (National Council for Science and Technology), the National Agency of Scientific and Technological Promotion (ANPCyT, PICT2019-03024) and the Department of Engineering and Architecture of the University of Trieste.

Funding

The authors have not disclosed any funding.

Author information

Authors and Affiliations

  1. Multidisciplinary Laboratory, International Centre for Theoretical Physics (ICTP), 34100, Trieste, Italy

    A. Cicuttin, M. L. Crespo, L. Garcia, W. Florian Samayoa & A. Silva

  2. Department of Engineering and Architecture, Università degli Studi di Trieste, 34127, Trieste, Italy

    L. Garcia & W. Florian Samayoa

  3. Instituto de Investigaciones Científicas y Tecnológicas en Electrónica (ICyTE), Facultad de Ingeniería, Universidad Nacional de Mar del Plata (UNMDP) – CONICET, Mar del Plata, Argentina

    L. De Micco, M. Antonelli & A. Silva

Authors
  1. A. Cicuttin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. De Micco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. L. Crespo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Antonelli
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. L. Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. W. Florian Samayoa
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. A. Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to L. De Micco.

Ethics declarations

Conflict of interest

The authors have no conflicts of interest to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cicuttin, A., De Micco, L., Crespo, M.L. et al. Looking for suitable rules for true random number generation with asynchronous cellular automata. Nonlinear Dyn 111, 2711–2722 (2023). https://doi.org/10.1007/s11071-022-07957-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11071-022-07957-8

Keywords

Search

Navigation