Pseudorandom number generation based on controllable cellular automata

Sheng Uei Guan; Shu Zhang

doi:10.1016/S0167-739X(03)00128-6

Pseudorandom number generation based on controllable cellular automata

Sheng Uei Guan^*, Shu Zhang

^*Corresponding author for this work

National University of Singapore

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

10 Citations (Scopus)

Abstract

A novel cellular automata (CA) - controllable CA (CCA) is proposed in this paper. Further, CCA are applied in pseudorandom number generation. Randomness test results on CCA pseudorandom number generators (PRNGs) show that they are better than one-dimensional (1D) CA PRNGs and can be comparable to two-dimensional (2D) ones. But they do not lose the structure simplicity of 1D CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired.

Original language	English
Pages (from-to)	627-641
Number of pages	15
Journal	Future Generation Computer Systems
Volume	20
Issue number	4
DOIs	https://doi.org/10.1016/S0167-739X(03)00128-6
Publication status	Published - 3 May 2004
Externally published	Yes

Keywords

Cellular automata
Controllable
Hybrid
Pseudorandom number generator
Randomness test

Access to Document

10.1016/S0167-739X(03)00128-6

Cite this

@article{fd39d4aab3f24c82be58912e82167a99,

title = "Pseudorandom number generation based on controllable cellular automata",

abstract = "A novel cellular automata (CA) - controllable CA (CCA) is proposed in this paper. Further, CCA are applied in pseudorandom number generation. Randomness test results on CCA pseudorandom number generators (PRNGs) show that they are better than one-dimensional (1D) CA PRNGs and can be comparable to two-dimensional (2D) ones. But they do not lose the structure simplicity of 1D CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired.",

keywords = "Cellular automata, Controllable, Hybrid, Pseudorandom number generator, Randomness test",

author = "Guan, {Sheng Uei} and Shu Zhang",

year = "2004",

month = may,

day = "3",

doi = "10.1016/S0167-739X(03)00128-6",

language = "English",

volume = "20",

pages = "627--641",

journal = "Future Generation Computer Systems",

issn = "0167-739X",

number = "4",

}

TY - JOUR

T1 - Pseudorandom number generation based on controllable cellular automata

AU - Guan, Sheng Uei

AU - Zhang, Shu

PY - 2004/5/3

Y1 - 2004/5/3

N2 - A novel cellular automata (CA) - controllable CA (CCA) is proposed in this paper. Further, CCA are applied in pseudorandom number generation. Randomness test results on CCA pseudorandom number generators (PRNGs) show that they are better than one-dimensional (1D) CA PRNGs and can be comparable to two-dimensional (2D) ones. But they do not lose the structure simplicity of 1D CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired.

AB - A novel cellular automata (CA) - controllable CA (CCA) is proposed in this paper. Further, CCA are applied in pseudorandom number generation. Randomness test results on CCA pseudorandom number generators (PRNGs) show that they are better than one-dimensional (1D) CA PRNGs and can be comparable to two-dimensional (2D) ones. But they do not lose the structure simplicity of 1D CA. Further, we develop several different types of CCA PRNGs. Based on the comparison of the randomness of different CCA PRNGs, we find that their properties are decided by the actions of the controllable cells and their neighbors. These novel CCA may be applied in other applications where structure non-uniformity or asymmetry is desired.

KW - Cellular automata

KW - Controllable

KW - Hybrid

KW - Pseudorandom number generator

KW - Randomness test

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

U2 - 10.1016/S0167-739X(03)00128-6

DO - 10.1016/S0167-739X(03)00128-6

M3 - Article

AN - SCOPUS:1842588903

SN - 0167-739X

VL - 20

SP - 627

EP - 641

JO - Future Generation Computer Systems

JF - Future Generation Computer Systems

IS - 4

ER -

Pseudorandom number generation based on controllable cellular automata

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this