A Full Cycle Length Pseudorandom Number Generator Based on Compositions of Automata

Authors

  • Pál Dömösi University of Nyíregyháza
  • József Gáll University of Debrecen
  • Géza Horváth University of Debrecen
  • Bertalan Borsos Eötvös Loránd University
  • Norbert Tihanyi Eötvös Loránd University
  • Yousef Alhammadi United Arab Emirates University

DOI:

https://doi.org/10.31449/inf.v45i2.3109

Abstract

In this paper a new Pseudorandom Number Generator based on compositions of abstract automata is presented. We show that it has full cycle with length of 2^128. It is also shown that the output satisfies the statistical requirements of the NIST randomness test suite.

Downloads

Published

2021-06-15

How to Cite

Dömösi, P., Gáll, J., Horváth, G., Borsos, B., Tihanyi, N., & Alhammadi, Y. (2021). A Full Cycle Length Pseudorandom Number Generator Based on Compositions of Automata. Informatica, 45(2). https://doi.org/10.31449/inf.v45i2.3109

Issue

Section

MATCOS-19