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

doi:10.31449/inf.v45i2.3109

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

Department of Information System and Security

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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	https://doi.org/10.31449/inf.v45i2.3109
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

Access to Document

10.31449/inf.v45i2.3109

Cite this

@article{6a7fed193b9248968a809479e63cab3a,

title = "A full cycle length pseudorandom number generator based on compositions of automata",

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.",

keywords = "Automata network, Block cipher, Composition of automata, Glu{\v s}kov product of automata, NIST test, Pseudo random number generator, Temporal product of automata",

author = "P{\'a}l D{\"o}m{\"o}si and J{\'o}zsef G{\'a}ll and G{\'e}za Horv{\'a}th and Bertalan Borsos and Norbert Tihanyi and {Al Hammadi}, Yousef",

year = "2021",

month = jun,

doi = "10.31449/inf.v45i2.3109",

language = "English",

volume = "45",

pages = "179--189",

journal = "Informatica (Slovenia)",

issn = "0350-5596",

publisher = "Slovene Society Informatika",

number = "2",

}

TY - JOUR

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

AU - Dömösi, Pál

AU - Gáll, József

AU - Horváth, Géza

AU - Borsos, Bertalan

AU - Tihanyi, Norbert

AU - Al Hammadi, Yousef

PY - 2021/6

Y1 - 2021/6

N2 - 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.

AB - 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.

KW - Automata network

KW - Block cipher

KW - Composition of automata

KW - Gluškov product of automata

KW - NIST test

KW - Pseudo random number generator

KW - Temporal product of automata

UR - http://www.scopus.com/inward/record.url?scp=85112300227&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85112300227&partnerID=8YFLogxK

U2 - 10.31449/inf.v45i2.3109

DO - 10.31449/inf.v45i2.3109

M3 - Article

AN - SCOPUS:85112300227

SN - 0350-5596

VL - 45

SP - 179

EP - 189

JO - Informatica (Slovenia)

JF - Informatica (Slovenia)

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this