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 language | English |
---|---|
Pages (from-to) | 179-189 |
Number of pages | 11 |
Journal | Informatica (Slovenia) |
Volume | 45 |
Issue number | 2 |
DOIs | |
Publication status | Published - 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