Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/71522
DC FieldValue
dc.titlePseudorandom number generator - The Self Programmable Cellular Automata
dc.contributor.authorGuan, S.-U.
dc.contributor.authorTan, S.K.
dc.date.accessioned2014-06-19T03:24:40Z
dc.date.available2014-06-19T03:24:40Z
dc.date.issued2003
dc.identifier.citationGuan, S.-U.,Tan, S.K. (2003). Pseudorandom number generator - The Self Programmable Cellular Automata. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) 2773 PART 1 : 1230-1235. ScholarBank@NUS Repository.
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/71522
dc.description.abstractThis 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitleLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
dc.description.volume2773 PART 1
dc.description.page1230-1235
dc.description.codenLNAIE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

77
checked on May 12, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.