{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:38:58Z","timestamp":1743136738463,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789811905414"},{"type":"electronic","value":"9789811905421"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-19-0542-1_11","type":"book-chapter","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T05:02:47Z","timestamp":1651035767000},"page":"139-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Asynchronous Cellular Automata as Randomness Enhancer"],"prefix":"10.1007","author":[{"given":"Souvik","family":"Roy","sequence":"first","affiliation":[]},{"given":"Sumit","family":"Adak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,28]]},"reference":[{"key":"11_CR1","volume-title":"A New Kind of Science","author":"S Wolfram","year":"2002","unstructured":"Wolfram, S.: A New Kind of Science. Wolfram-Media Inc., Champaign, Ilinois, United States (2002)"},{"unstructured":"von Neumann, J.: The Theory of Self-reproducing Automata, A. W. Burks ed. Univ. of Illinois Press, Urbana and London (1966)","key":"11_CR2"},{"unstructured":"Chaudhuri, P.P., Chowdhury, D.R., Nandi, S., Chatterjee, S.: Additive cellular automata\u2014theory and applications. IEEE Comput. Soc. Press USA 1 ISBN 0-8186-7717-1 (1997)","key":"11_CR3"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s11047-018-9696-8","volume":"19","author":"K Bhattacharjee","year":"2020","unstructured":"Bhattacharjee, K., Naskar, N., Roy, S., Das, S.: A survey of cellular automata: types, dynamics, non-uniformity and applications. Natural Comput. 19, 433\u2013461 (2020)","journal-title":"Natural Comput."},{"doi-asserted-by":"crossref","unstructured":"Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (Ed.) Advances in Cryptology\u2014CRYPTO \u201985 Proceedings, pp. 429\u2013432. Springer, Berlin, Heidelberg (1986)","key":"11_CR5","DOI":"10.1007\/3-540-39799-X_32"},{"doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (Ed.) Advances in Cryptology\u2014CRYPTO\u2019 89 Proceedings, pp. 416\u2013427. Springer, New York (1990)","key":"11_CR6","DOI":"10.1007\/0-387-34805-0_39"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1017\/S014338579706985X","volume":"17","author":"P Kurka","year":"1997","unstructured":"Kurka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory Dyn. Syst. 17, 417\u2013433 (1997)","journal-title":"Ergodic Theory Dyn. Syst."},{"doi-asserted-by":"crossref","unstructured":"Meier, W., Staffelbach, O.: Analysis of pseudo random sequence generated by cellular automata. In: Advances in Cryptology\u2014EUROCRYPT \u201991, Workshop on the Theory and Application of of Cryptographic Techniques, Brighton, UK, April 8\u201311,: Proceedings, ser. Lecture Notes in Computer Science, vol. 547. Springer 1991, 186\u2013199 (1991)","key":"11_CR8","DOI":"10.1007\/3-540-46416-6_17"},{"issue":"10","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1109\/12.35843","volume":"38","author":"PD Hortensius","year":"1989","unstructured":"Hortensius, P.D., McLeod, R.D., Card, H.C.: Parallel random number generation for vlsi systems using cellular automata. IEEE Trans. Comput. 38(10), 1466\u20131473 (1989)","journal-title":"IEEE Trans. Comput."},{"issue":"03","key":"11_CR10","doi-asserted-by":"publisher","first-page":"2050037","DOI":"10.1142\/S0129183120500370","volume":"31","author":"S Adak","year":"2020","unstructured":"Adak, S., Bhattacharjee, K., Das, S.: Maximal length cellular automata in $$gf$$(q) and pseudo-random number generation. Int. J. Modern Phys. C 31(03), 2050037 (2020)","journal-title":"Int. J. Modern Phys. C"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R Cori","year":"1993","unstructured":"Cori, R., Metivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Inform. Comput. 106(2), 159\u2013202 (1993)","journal-title":"Inform. Comput."},{"issue":"1\u20132","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(00)00166-3","volume":"247","author":"M Droste","year":"2000","unstructured":"Droste, M., Gastin, P., Kuske, D.: Asynchronous cellular automata for pomsets. Theoret. Comput. Sci. 247(1\u20132), 1\u201338 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"S1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1002\/cplx.21749","volume":"21","author":"B Sethi","year":"2016","unstructured":"Sethi, B., Roy, S., Das, S.: Asynchronous cellular automata and pattern classification. Complexity 21(S1), 370\u2013386 (2016)","journal-title":"Complexity"},{"unstructured":"Sethi, B., Das, S.: On the use of asynchronous cellular automata in symmetric-key cryptography. In: Mueller, P., Thampi, S.M., Alam\u00a0Bhuiyan, M.Z., Ko, R., Doss, R., Alcaraz\u00a0Calero, J.M. (Eds.) Security in Computing and Communications, pp. 30\u201341. Springer, Singapore (2016)","key":"11_CR14"},{"key":"11_CR15","first-page":"428","volume-title":"Cellular Automata","author":"L Manzoni","year":"2018","unstructured":"Manzoni, L., Mariot, L.: Cellular automata pseudo-random number generators and their resistance to asynchrony. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds.) Cellular Automata, pp. 428\u2013437. Springer International Publishing, Cham (2018)"},{"unstructured":"Marsaglia, G.: DIEHARD: A battery of tests of randomness. http:\/\/stat.fsu.edu\/geo\/diehard.html (1996)","key":"11_CR16"},{"key":"11_CR17","first-page":"281","volume":"4","author":"W Li","year":"1990","unstructured":"Li, W., Packard, N.: The structure of the elementary cellular automata rule space. Complex Syst. 4, 281\u2013297 (1990)","journal-title":"Complex Syst."},{"issue":"04","key":"11_CR18","doi-asserted-by":"publisher","first-page":"2150054","DOI":"10.1142\/S0129183121500546","volume":"32","author":"S Roy","year":"2021","unstructured":"Roy, S., Das, S.: Asynchronous cellular automata that hide some of the configurations during evolution. Int. J. Modern Phys. C 32(04), 2150054 (2021)","journal-title":"Int. J. Modern Phys. C"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2006.05.036","volume":"362","author":"N Fat\u00e8s","year":"2006","unstructured":"Fat\u00e8s, N., Thierry, E., Morvan, M., Schabanel, N.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theoret. Comput. Sci. 362(1), 1\u201316 (2006)","journal-title":"Theoret. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Syst. 21, 71\u201384 (2012)","key":"11_CR20","DOI":"10.25088\/ComplexSystems.21.1.71"},{"key":"11_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-06089-7_4","volume-title":"Theory and Applications of Models of Computation","author":"B Sethi","year":"2014","unstructured":"Sethi, B., Fat\u00e8s, N., Das, S.: Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) Theory and Applications of Models of Computation, pp. 39\u201349. Springer International Publishing, Cham (2014)"},{"key":"11_CR22","first-page":"313","volume-title":"On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View","author":"N Fat\u00e8s","year":"2018","unstructured":"Fat\u00e8s, N., Sethi, B., Das, S.: On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View, pp. 313\u2013332. Springer International Publishing, Cham (2018)"},{"unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd\u00a0ed. Boston: Addison-Wesley (1997)","key":"11_CR23"},{"unstructured":"Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., Vo, S.: Statistical test suite for random and pseudorandom number generators for cryptographic applications, NIST special publication. revision 1a. National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce, vol. 800-22 (2010)","key":"11_CR24"},{"doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Simard, R.: TestU01: a c library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4), 22:1\u201322:40 (2007)","key":"11_CR25","DOI":"10.1145\/1268776.1268777"},{"unstructured":"McGrath, R. et\u00a0al.: GNU C Library. https:\/\/www.gnu.org\/software\/libc\/manual\/html_node\/Pseudo_002dRandom-Numbers.html#index-pseudo_002drandom-numbers","key":"11_CR26"},{"unstructured":"Bhattacharjee, K., Maity, K., Das, S.: A search for good pseudo-random number generators : survey and empirical studies. CoRR vol. abs\/1811.04035, 2018. [Online]. http:\/\/arxiv.org\/abs\/1811.04035","key":"11_CR27"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of First Asian Symposium on Cellular Automata Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-19-0542-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T05:04:04Z","timestamp":1651035844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-19-0542-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811905414","9789811905421"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-19-0542-1_11","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Cellular Automata Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ascat2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}