{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:07Z","timestamp":1761596707945},"reference-count":15,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0141-9331(97)00009-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:57:07Z","timestamp":1027641427000},"page":"643-658","source":"Crossref","is-referenced-by-count":15,"title":["Comparison between cellular automata and linear feedback shift registers based pseudo-random number generators"],"prefix":"10.1016","volume":"20","author":[{"given":"I.","family":"Kokolakis","sequence":"first","affiliation":[]},{"given":"I.","family":"Andreadis","sequence":"additional","affiliation":[]},{"given":"Ph.","family":"Tsalides","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0141-9331(97)00009-4_BIB1","doi-asserted-by":"crossref","unstructured":"R.N. Mutagi, Pseudo noise sequences for engineers, Electronics and Communications J. (April 1996) 79\u201387.","DOI":"10.1049\/ecej:19960205"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB2","unstructured":"D.E. Knuth, The Art of Computer Programming: Seminumerical Algorithms, Addison\u2013Wesley, Reading, MA, 1981."},{"key":"10.1016\/S0141-9331(97)00009-4_BIB3","doi-asserted-by":"crossref","unstructured":"P.D. Hortensius, R.D. McLeod, H.C. Card, Cellular automata-based signature analysis for built-in self-test, IEEE Trans. Computers 39(10) (1990) 1273\u20131283.","DOI":"10.1109\/12.59857"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB4","doi-asserted-by":"crossref","unstructured":"Ph. Tsalides, T.A. York, A. Thanailakis, Pseudo-random number generators for VLSI systems based on linear cellular automata, IEE Proc. E 138(4) (1991) 241\u2013249.","DOI":"10.1049\/ip-e.1991.0031"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB5","doi-asserted-by":"crossref","unstructured":"A.K. Das, P.P. Chaudhuri, Vector space theoretic analysis of additive cellular automata and its application for pseudo-exhaustive test pattern generation, IEEE Trans. Computers 42(3) (1993) 340\u2013352.","DOI":"10.1109\/12.210176"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB6","doi-asserted-by":"crossref","unstructured":"Th. Damarla, A. Sathye, Applications of one-dimensional cellular automata and linear feedback shift registers for pseudo-exhaustive testing, IEEE Trans. Computer Aided Design 12(10) (1993) 1580\u20131591.","DOI":"10.1109\/43.256933"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB7","doi-asserted-by":"crossref","unstructured":"K. Zeng, C.H. Yang, D.Y. Wei, T.R.N. Rao, Pseudo-random bit generators in stream-cipher cryptography, IEEE Computer (February 1991) 8\u201317.","DOI":"10.1109\/2.67207"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB8","doi-asserted-by":"crossref","unstructured":"C.A. Chen, S.K. Gupta, BIST test pattern generators for two-pattern testing: theory and design algorithms, IEEE Trans. Computers 45(3) (1996) 257\u2013269.","DOI":"10.1109\/12.485565"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB9","doi-asserted-by":"crossref","unstructured":"S. Wolfram, Statistical mechanics of cellular automata, Rev. Modern Physics 55(3) (1983) 601\u2013644.","DOI":"10.1103\/RevModPhys.55.601"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB10","doi-asserted-by":"crossref","unstructured":"O. Martin, A.M. Odlyzko, S. Wolfram, Algebraic properties of cellular automata, Comm. Math. Phys. 93 (1984) 219\u2013258.","DOI":"10.1007\/BF01223745"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB11","doi-asserted-by":"crossref","unstructured":"W. Pries, A. Thanailakis, H.C. Card, Group properties of cellular automata and VLSI applications, IEEE Trans. Computers 35(12) (1986) 1013\u20131024.","DOI":"10.1109\/TC.1986.1676709"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB12","doi-asserted-by":"crossref","unstructured":"N. Pitsianis, Ph. Tsalides, G.L. Bleris, A. Thanailakis, H.C. Card, Deterministic one-dimensional cellular automata, J. Statistical Phys. 56(1\u20132) (1989) 1\u201319.","DOI":"10.1007\/BF01044234"},{"key":"10.1016\/S0141-9331(97)00009-4_BIB13","unstructured":"S.W. Golomb, Shift Register Sequences, Holden\u2013Day, San Francisco, CA, 1967."},{"key":"10.1016\/S0141-9331(97)00009-4_BIB14","unstructured":"Lecture Notes in Computer Science: Cryptography, Vol. 149, Springer-Verlag, Berlin, 1982."},{"key":"10.1016\/S0141-9331(97)00009-4_BIB15","doi-asserted-by":"crossref","unstructured":"S. Nandi, P.P. Chaudhuri, Analysis of periodic and intermediate boundary 90\/150 cellular automata, IEEE Trans. Computers 45(1) (1996) 1\u201312.","DOI":"10.1109\/12.481481"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933197000094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933197000094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T23:10:21Z","timestamp":1580339421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0141933197000094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":15,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0141933197000094"],"URL":"https:\/\/doi.org\/10.1016\/s0141-9331(97)00009-4","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}