{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:25:34Z","timestamp":1740108334330,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T00:00:00Z","timestamp":1686182400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T00:00:00Z","timestamp":1686182400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100009232","name":"University of Debrecen","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100009232","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Random numbers are very important in many fields of computer science. Generating high-quality random numbers using only basic arithmetic operations is challenging, especially for devices with limited hardware capabilities, such as Internet of Things (IoT) devices. In this paper, we present a novel pseudorandom number generator, the simple chain automaton random number generator (SCARNG), based on compositions of abstract automata. The main advantage of the presented algorithm is its simple structure that can be implemented easily for very low computing capacity IoT systems, FPGAs or GPU hardware. The generated random numbers demonstrate promising statistical behavior and satisfy the NIST statistical suite requirements, highlighting the potential of the SCARNG for practical applications.<\/jats:p>","DOI":"10.1007\/s00236-023-00440-w","type":"journal-article","created":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T18:01:57Z","timestamp":1686247317000},"page":"317-329","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Simple chain automaton random number generator for IoT devices"],"prefix":"10.1007","volume":"60","author":[{"given":"P\u00e1l","family":"D\u00f6m\u00f6si","sequence":"first","affiliation":[]},{"given":"G\u00e9za","family":"Horv\u00e1th","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Tihanyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,8]]},"reference":[{"issue":"1","key":"440_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/49.192730","volume":"6","author":"RFW Coates","year":"1988","unstructured":"Coates, R.F.W., Janacek, G.J., Lever, K.V.: Monte Carlo simulation and random number generation. IEEE J. Select. Areas Commun. 6(1), 58\u201366 (1988). https:\/\/doi.org\/10.1109\/49.192730","journal-title":"IEEE J. Select. Areas Commun."},{"doi-asserted-by":"publisher","unstructured":"Tihanyi, N., Borsos, B.: A general construction for generating pseudorandom sequences using the digit expansion of real functions. In: 2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 48\u201354. IEEE, Timisoara, Romania (2020). https:\/\/doi.org\/10.1109\/SYNASC51798.2020.00019. https:\/\/www.ieeexplore.ieee.org\/document\/9357086\/. Accessed 2023-04-20","key":"440_CR2","DOI":"10.1109\/SYNASC51798.2020.00019"},{"issue":"3","key":"440_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1109\/81.915396","volume":"48","author":"T Stojanovski","year":"2001","unstructured":"Stojanovski, T., Pihl, J., Kocarev, L.: Chaos-based random number generators. Part II: practical realization. IEEE Trans. Circuits Syst.I: Fundam. Theory Appl. 48(3), 382\u2013385 (2001). https:\/\/doi.org\/10.1109\/81.915396","journal-title":"IEEE Trans. Circuits Syst.I: Fundam. Theory Appl."},{"issue":"2","key":"440_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0196-8858(86)90028-X","volume":"7","author":"S Wolfram","year":"1986","unstructured":"Wolfram, S.: Random sequence generation by cellular automata. Adv. Appl. Math. 7(2), 123\u2013169 (1986). https:\/\/doi.org\/10.1016\/0196-8858(86)90028-X","journal-title":"Adv. Appl. Math."},{"issue":"10","key":"440_CR5","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). https:\/\/doi.org\/10.1109\/12.35843","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"440_CR6","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1109\/43.31545","volume":"8","author":"PD Hortensius","year":"1989","unstructured":"Hortensius, P.D., McLeod, R.D., Pries, W., Miller, D.M., Card, H.C.: Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 8(8), 842\u2013859 (1989). https:\/\/doi.org\/10.1109\/43.31545","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"440_CR7","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/S0167-739X(03)00128-6","volume":"20","author":"S-U Guan","year":"2004","unstructured":"Guan, S.-U., Zhang, S.: Pseudorandom number generation based on controllable cellular automata. Futur. Gener. Comput. Syst. 20(4), 627\u2013641 (2004). https:\/\/doi.org\/10.1016\/S0167-739X(03)00128-6","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"7","key":"440_CR8","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TCAD.2004.829808","volume":"23","author":"S-U Guan","year":"2004","unstructured":"Guan, S.-U., Tan, S.K.: Pseudorandom number generation with self-programmable cellular automata. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(7), 1095\u20131101 (2004). https:\/\/doi.org\/10.1109\/TCAD.2004.829808","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"doi-asserted-by":"publisher","unstructured":"Comer, J.M., Cerda, J.C., Martinez, C.D., Hoe, D.H.K.: Random number generators using Cellular Automata implemented on FPGAs. In: Proceedings of the 2012 44th Southeastern Symposium on System Theory (SSST), pp. 67\u201372. IEEE, Jacksonville, FL, USA (2012). https:\/\/doi.org\/10.1109\/SSST.2012.6195137 . https:\/\/www.ieeexplore.ieee.org\/document\/6195137\/. Accessed 2023-04-01","key":"440_CR9","DOI":"10.1109\/SSST.2012.6195137"},{"issue":"2","key":"440_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S1568-4946(01)00015-1","volume":"1","author":"M Tomassini","year":"2001","unstructured":"Tomassini, M., Perrenoud, M.: Cryptography with cellular automata. Appl. Soft Comput. 1(2), 151\u2013160 (2001). https:\/\/doi.org\/10.1016\/S1568-4946(01)00015-1","journal-title":"Appl. Soft Comput."},{"issue":"11","key":"440_CR11","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1109\/TC.2004.94","volume":"53","author":"F Bao","year":"2004","unstructured":"Bao, F.: Cryptanalysis of a partially known cellular automata cryptosystem. IEEE Trans. Comput. 53(11), 1493\u20131497 (2004). https:\/\/doi.org\/10.1109\/TC.2004.94","journal-title":"IEEE Trans. Comput."},{"key":"440_CR12","doi-asserted-by":"publisher","first-page":"372","DOI":"10.4028\/www.scientific.net\/AMR.981.372","volume":"981","author":"TJ Zhang","year":"2014","unstructured":"Zhang, T.J., Manhrawy, I.M., Abdo, A.A., El-Latif, A.A.A., Rhouma, R.: Cryptanalysis of elementary cellular automata based image encryption. Adv. Mater. Res. 981, 372\u2013375 (2014). https:\/\/doi.org\/10.4028\/www.scientific.net\/AMR.981.372","journal-title":"Adv. Mater. Res."},{"issue":"15","key":"440_CR13","doi-asserted-by":"publisher","first-page":"2787","DOI":"10.1016\/j.comnet.2010.05.010","volume":"54","author":"L Atzori","year":"2010","unstructured":"Atzori, L., Iera, A., Morabito, G.: The internet of things: a survey. Comput. Netw. 54(15), 2787\u20132805 (2010). https:\/\/doi.org\/10.1016\/j.comnet.2010.05.010","journal-title":"Comput. Netw."},{"issue":"4","key":"440_CR14","doi-asserted-by":"publisher","first-page":"3453","DOI":"10.1109\/COMST.2018.2855563","volume":"20","author":"I Stellios","year":"2018","unstructured":"Stellios, I., Kotzanikolaou, P., Psarakis, M., Alcaraz, C., Lopez, J.: A survey of IoT-enabled cyberattacks: assessing attack paths to critical infrastructures and services. IEEE Commun. Surv. Tutor. 20(4), 3453\u20133495 (2018). https:\/\/doi.org\/10.1109\/COMST.2018.2855563","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"1","key":"440_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.14232\/actacyb.23.1.2017.20","volume":"23","author":"P D\u00f6m\u00f6si","year":"2017","unstructured":"D\u00f6m\u00f6si, P., G\u00e1ll, J., Horv\u00e1th, G., Tihanyi, N.: Statistical analysis of DH1 cryptosystem. Acta Cybernet. 23(1), 371\u2013378 (2017). https:\/\/doi.org\/10.14232\/actacyb.23.1.2017.20","journal-title":"Acta Cybernet."},{"key":"440_CR16","doi-asserted-by":"publisher","DOI":"10.31449\/inf.v43i2.2687","author":"P D\u00f6m\u00f6si","year":"2019","unstructured":"D\u00f6m\u00f6si, P., G\u00e1ll, J., Horv\u00e1th, G., Tihanyi, N.: Some remarks and tests on the DH1 cryptosystem based on automata compositions. Informatica (2019). https:\/\/doi.org\/10.31449\/inf.v43i2.2687","journal-title":"Informatica"},{"doi-asserted-by":"publisher","unstructured":"Borsos, B., D\u00f6m\u00f6si, P., Alhammadi, Y., Tihanyi, N., G\u00e1ll, J., Horv\u00e1th, G.: A pseudorandom number generator with full cycle length based on automata compositions. Informatica (2021). https:\/\/doi.org\/10.31449\/inf.v45i2.3109","key":"440_CR17","DOI":"10.31449\/inf.v45i2.3109"},{"doi-asserted-by":"publisher","unstructured":"Bassham, L.E., Rukhin, A.L., Soto, J., Nechvatal, J.R., Smid, M.E., Barker, E.B., Leigh, S.D., Levenson, M., Vangel, M., Banks, D.L., Heckert, N.A., Dray, J.F., Vo, S.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. Technical Report NIST SP 800-22r1a, National Institute of Standards and Technology, Gaithersburg, MD (2010). https:\/\/doi.org\/10.6028\/NIST.SP.800-22r1a. Edition: 0. https:\/\/www.nvlpubs.nist.gov\/nistpubs\/Legacy\/SP\/nistspecialpublication800-22r1a.pdf. Accessed 2023-04-17","key":"440_CR18","DOI":"10.6028\/NIST.SP.800-22r1a"},{"doi-asserted-by":"crossref","unstructured":"D\u00f6m\u00f6si, P., Nehaniv, C.L.: Algebraic Theory of Automata Networks: an Introduction. SIAM monographs on discrete mathematics and applications. Society for Industrial and Applied Mathematics, Philadelphia (2005)","key":"440_CR19","DOI":"10.1137\/1.9780898718492"},{"doi-asserted-by":"publisher","unstructured":"Salmon, J.K., Moraes, M.A., Dror, R.O., Shaw, D.E.: Parallel random numbers: as easy as 1, 2, 3. In: Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201312. ACM, Seattle Washington (2011). https:\/\/doi.org\/10.1145\/2063384.2063405","key":"440_CR20","DOI":"10.1145\/2063384.2063405"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-023-00440-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-023-00440-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-023-00440-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T09:03:08Z","timestamp":1691658188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-023-00440-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,8]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["440"],"URL":"https:\/\/doi.org\/10.1007\/s00236-023-00440-w","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2023,6,8]]},"assertion":[{"value":"24 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}