Pseudorandom number generator - The Self Programmable Cellular Automata

Sheng Uei Guan; Syn Kiat Tan

doi:10.1007/978-3-540-45224-9_166

Pseudorandom number generator - The Self Programmable Cellular Automata

Sheng Uei Guan^*, Syn Kiat Tan

^*Corresponding author for this work

National University of Singapore

Research output: Contribution to journal › Conference article › peer-review

1 Citation (Scopus)

Abstract

This paper deals with the problem of generating high quality random number sequences for cryptography. A new class of CA, the Self Programmable Cellular Automata (SPCA) is proposed. Experimental results showed the sequences generated performed well in the ENT and DIEHARD test suites; comparable to the results obtained by other researchers. Furthermore, the SPCA has implementation space savings over other similar variants of CA. The SPCA uses only Boolean operations hence it is ideally suitable for VLSI hardware implementation.

Original language	English
Pages (from-to)	1230-1235
Number of pages	6
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2773 PART 1
DOIs	https://doi.org/10.1007/978-3-540-45224-9_166
Publication status	Published - 2003
Externally published	Yes
Event	7th International Conference, KES 2003 - Oxford, United Kingdom Duration: 3 Sept 2003 → 5 Sept 2003

Access to Document

10.1007/978-3-540-45224-9_166

Cite this

@article{12477d18c6df4763be0dbb489dda5521,

title = "Pseudorandom number generator - The Self Programmable Cellular Automata",

abstract = "This paper deals with the problem of generating high quality random number sequences for cryptography. A new class of CA, the Self Programmable Cellular Automata (SPCA) is proposed. Experimental results showed the sequences generated performed well in the ENT and DIEHARD test suites; comparable to the results obtained by other researchers. Furthermore, the SPCA has implementation space savings over other similar variants of CA. The SPCA uses only Boolean operations hence it is ideally suitable for VLSI hardware implementation.",

author = "Guan, {Sheng Uei} and Tan, {Syn Kiat}",

year = "2003",

doi = "10.1007/978-3-540-45224-9_166",

language = "English",

volume = "2773 PART 1",

pages = "1230--1235",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

note = "7th International Conference, KES 2003 ; Conference date: 03-09-2003 Through 05-09-2003",

}

TY - JOUR

T1 - Pseudorandom number generator - The Self Programmable Cellular Automata

AU - Guan, Sheng Uei

AU - Tan, Syn Kiat

PY - 2003

Y1 - 2003

N2 - This paper deals with the problem of generating high quality random number sequences for cryptography. A new class of CA, the Self Programmable Cellular Automata (SPCA) is proposed. Experimental results showed the sequences generated performed well in the ENT and DIEHARD test suites; comparable to the results obtained by other researchers. Furthermore, the SPCA has implementation space savings over other similar variants of CA. The SPCA uses only Boolean operations hence it is ideally suitable for VLSI hardware implementation.

AB - This paper deals with the problem of generating high quality random number sequences for cryptography. A new class of CA, the Self Programmable Cellular Automata (SPCA) is proposed. Experimental results showed the sequences generated performed well in the ENT and DIEHARD test suites; comparable to the results obtained by other researchers. Furthermore, the SPCA has implementation space savings over other similar variants of CA. The SPCA uses only Boolean operations hence it is ideally suitable for VLSI hardware implementation.

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

U2 - 10.1007/978-3-540-45224-9_166

DO - 10.1007/978-3-540-45224-9_166

M3 - Conference article

AN - SCOPUS:8344219729

SN - 0302-9743

VL - 2773 PART 1

SP - 1230

EP - 1235

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 7th International Conference, KES 2003

Y2 - 3 September 2003 through 5 September 2003

ER -

Pseudorandom number generator - The Self Programmable Cellular Automata

Abstract

Access to Document

Other files and links

Cite this