A full cycle length pseudorandom number generator based on compositions of automata

Pál Dömösi, József Gáll, Géza Horváth, Bertalan Borsos, Norbert Tihanyi, Yousef Al Hammadi

Research output: Contribution to journalArticlepeer-review

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

Original languageEnglish
Pages (from-to)179-189
Number of pages11
JournalInformatica (Slovenia)
Volume45
Issue number2
DOIs
Publication statusPublished - Jun 2021

Keywords

  • Automata network
  • Block cipher
  • Composition of automata
  • Gluškov product of automata
  • NIST test
  • Pseudo random number generator
  • Temporal product of automata

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Computer Science Applications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'A full cycle length pseudorandom number generator based on compositions of automata'. Together they form a unique fingerprint.

Cite this