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

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 2128. It is also shown that the output satisñes the statistical requirements of the NIST randomness test suite.

Saved in:
Bibliographic Details
Published inInformatica (Ljubljana) Vol. 45; no. 2; pp. 179 - 189
Main Authors Dömösi, Pál, Gáll, József, Horváth, Géza, Borsos, Bertalan, Tihanyi, Norbert, Al Hammadi, Yousef
Format Journal Article
LanguageEnglish
Published Ljubljana Slovenian Society Informatika / Slovensko drustvo Informatika 01.06.2021
Subjects
Composition
Generators
Numbers
Pseudorandom
Online AccessGet full text

Cover

More Information
Summary: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 2128. It is also shown that the output satisñes the statistical requirements of the NIST randomness test suite.
ISSN:0350-5596
1854-3871
DOI:10.31449/inf.v45i2.3109