{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:30:32Z","timestamp":1772253032612,"version":"3.50.1"},"reference-count":53,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T00:00:00Z","timestamp":1662508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Nowadays, the practice of developing algorithms to maintain the confidentiality of data shows that there is a lack of some features, such as velocity, predictability, etc. Generating pseudorandom numbers is one such problem that lies in the basement of many algorithms, even in hardware microprograms. An unreliable generator can cause cyberattacks on it, despite the security in the upper layers. At the same time, the algorithm should be fast enough to provide uninterrupted circuit work for the entire system. The paper presents a new algorithm generating pseudorandom numbers on cellular automata, which is not only fast and easy-repeating, but unpredictable enough and can be used in cryptographic systems. One of the main tasks of pseudorandom number generators (PRNG) is to present a high level of nonlinearity, or as it can also be named, asymmetry. Using the National Institute of Standards and Technology (NIST) statistical test suite for random number generators and pseudorandom number generators, it is shown that the presented algorithm is more than three times superior to the state-of-the-art methods and algorithms in terms of p-value. A high level of the presented algorithm\u2019s parallelization allows for implementation effectively on calculators with parallel structure. Central Processing Unit (CPU)-based architecture, Field-Programmable Gate Array (FPGA)-based architecture, Compute Unified Device Architecture (CUDA)-based architecture of PRNG and different PRNG implementations are presented to confirm the high performance of the proposed solution.<\/jats:p>","DOI":"10.3390\/sym14091869","type":"journal-article","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T09:51:09Z","timestamp":1662630669000},"page":"1869","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["High Performance Parallel Pseudorandom Number Generator on Cellular Automata"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4421-2411","authenticated-orcid":false,"given":"Alla","family":"Levina","sequence":"first","affiliation":[{"name":"Faculty of Computer Science and Technology, Saint Petersburg Electrotechnical University \u201cLETI\u201d, 197022 St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniyar","family":"Mukhamedjanov","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Technology, Saint Petersburg Electrotechnical University \u201cLETI\u201d, 197022 St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6607-3294","authenticated-orcid":false,"given":"Danil","family":"Bogaevskiy","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Technology, Saint Petersburg Electrotechnical University \u201cLETI\u201d, 197022 St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0487-4779","authenticated-orcid":false,"given":"Pavel","family":"Lyakhov","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Technology, Saint Petersburg Electrotechnical University \u201cLETI\u201d, 197022 St. Petersburg, Russia"},{"name":"Department of Applied Mathematics and Mathematical Modeling, North-Caucasus Federal University, 355000 Stavropol, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4732-3216","authenticated-orcid":false,"given":"Maria","family":"Valueva","sequence":"additional","affiliation":[{"name":"Department of Number Theoretic Systems, North-Caucasus Federal University, 355000 Stavropol, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2765-4509","authenticated-orcid":false,"given":"Dmitrii","family":"Kaplun","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science and Technology, Saint Petersburg Electrotechnical University \u201cLETI\u201d, 197022 St. Petersburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"ref_1","first-page":"2013","article-title":"RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis","volume":"857","author":"Genkin","year":"2013","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_2","first-page":"242","article-title":"Get Your Hands Off My Laptop: Physical Side-Channel Key-Extraction Attacks on PCs","volume":"5","author":"Genkin","year":"2014","journal-title":"J. Cryptogr. Eng."},{"key":"ref_3","first-page":"2015","article-title":"Stealing Keys from PCs by Radio: Cheap Electromagnetic Attacks on Windowed Exponentiation","volume":"170","author":"Genkin","year":"2015","journal-title":"IACR Cryptol. Eprint Arch."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2591","DOI":"10.1109\/ACCESS.2017.2665640","article-title":"Mobile Social Networking under Side-Channel Attacks: Practical Security Challenges","volume":"5","author":"Levina","year":"2017","journal-title":"IEEE Access"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Levina, A., Sleptsova, D., and Zaitsev, O. (2016, January 5\u20137). Side-channel attacks and machine learning approach. Proceedings of the Conference of Open Innovation Association, FRUCT, St. Petersburg, Russia.","DOI":"10.1109\/FRUCT-ISPIT.2016.7561525"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s13389-019-00215-5","article-title":"Physical model of sensitive data leakage from PC-based cryptographic systems","volume":"9","author":"Levina","year":"2019","journal-title":"J. Cryptogr. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2340","DOI":"10.1364\/AO.39.002340","article-title":"Stream cipher based on pseudo-random number generation using optical affine transformation","volume":"39","author":"Sasaki","year":"2000","journal-title":"Appl. Opt."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Biryukov, A., and Shamir, A. (2000, January 6\u201310). Cryptanalytic time\/memory\/data trade-offs for stream ciphers. Proceedings of the International Conference on the Theory and Application of Cryptology and Information Security, Singapore.","DOI":"10.1007\/3-540-44448-3_1"},{"key":"ref_9","unstructured":"Cunsheng, D. (2011). The Stability Theory of Stream Ciphers, Springer."},{"key":"ref_10","unstructured":"Haahr, M. (2021, November 19). True Random Number Service. Available online: www.random.org."},{"key":"ref_11","unstructured":"Brent, R. (2021, January 23). Uniform Random Number Generators for Supercomputers. Available online: https:\/\/www.semanticscholar.org\/paper\/Uniform-random-number-generators-for-supercomputers-Brent\/e67e46d2b5581c9d6300138155de3dc8197fd9bb."},{"key":"ref_12","unstructured":"Niels, F., Bruce, S., and Tadayoshi, K. (2010). Chapter 9: Generating Randomness. Cryptography Engineering: Design Principles and Practical Applications, Wiley Publishing, Inc."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Kelsey, J., Schneier, B., Wagner, D., and Hall, C. (1998). Cryptanalytic Attacks on Pseudorandom Number Generators, Springer. Fast Software Encryption.","DOI":"10.1007\/3-540-69710-1_12"},{"key":"ref_14","unstructured":"L\u2019Ecuyer, P. (2007). Chapter 4: Random Number Generation. Springer Handbooks of Computational Statistics, Springer."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Gollmann, D. (1996). ISAAC. Fast Software Encryption, Springer.","DOI":"10.1007\/3-540-60865-6"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., and Player, R. (2017, January 3\u20137). Simple Encrypted Arithmetic Library\u2014SEAL v2.1. Proceedings of the International Conference on Financial Cryptography and Data Security, Sliema, Malta.","DOI":"10.1007\/978-3-319-70278-0_1"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Kircanski, A., and Youssef, A.M. (2010). On the Sliding Property of SNOW 3G and SNOW 2.0, IET.","DOI":"10.1049\/iet-ifs.2011.0033"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1137\/0215025","article-title":"A Simple Unpredictable Pseudo-Random Number Generator","volume":"15","author":"Blum","year":"1986","journal-title":"SIAM J. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Li, S., Liu, Y., Ren, F., and Yang, Z. (2022). Design of a high throughput pseudo-random number generator based on discrete hyper-chaotic system. IEEE Trans. Circuits Syst. II Express Briefs.","DOI":"10.1109\/TCSII.2022.3178103"},{"key":"ref_20","first-page":"020505","article-title":"FPGA implementation and image encryption application of a new PRNG based on a memristive Hopfield neural network with a special activation gradient","volume":"31","author":"Yu","year":"2022","journal-title":"Chin. Phys. Soc. IOP Publ. Chin. Phys. B"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"690651","DOI":"10.3389\/fphy.2021.690651","article-title":"Design and FPGA Implementation of a Pseudo-random Number Generator Based on a Hopfield Neural Network Under Electromagnetic Radiation","volume":"9","author":"Yu","year":"2021","journal-title":"Front. Phys."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Pereira, D.H. (2022). Itamarac\u00e1: A Novel Simple Way to Generate Pseudo-Random Numbers, Cambridge University.","DOI":"10.36227\/techrxiv.17161487"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Moysis, L., Rajagopal, K., Tutueva, A.V., Volos, C., Teka, B., and Butusov, D.N. (2021). Chaotic Path Planning for 3D Area Coverage Using a Pseudo-Random Bit Generator from a 1D Chaotic Map. Mathematics, 9.","DOI":"10.3390\/math9151821"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/s11071-021-06246-0","article-title":"Improving chaos-based pseudo-random generators in finite-precision arithmetic","volume":"104","author":"Tutueva","year":"2021","journal-title":"Nonlinear Dyn."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"3817","DOI":"10.1007\/s13369-018-3688-y","article-title":"PRNG based on skew tent map","volume":"44","year":"2019","journal-title":"Arab. J. Sci. Eng."},{"key":"ref_26","first-page":"37","article-title":"Probability of Pulse Overlap as a Quantitative Indicator of Signal Environment Complexity","volume":"23","author":"Podstrigaev","year":"2020","journal-title":"J. Russ. Univ. Radioelectron."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Datcu, O., Macovei, C., and Hobincu, R. (2020). Chaos based cryptographic pseudo-random number generator template with dynamic state change. Appl. Sci., 10.","DOI":"10.3390\/app10020451"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P., Nadeau-Chamard, O., Chen, Y.-F., and Lebar, J. (2021, January 12\u201315). Multiple Streams with Recurrence-Based, Counter-Based, and Splittable Random Number Generators. Proceedings of the 2021 Winter Simulation Conference, Phoenix, AZ, USA.","DOI":"10.1109\/WSC52266.2021.9715397"},{"key":"ref_29","unstructured":"Lehmer, D.H. (, January April). Mathematical methods in large-scale computing units. Proceedings of the Second Symposium on Large-Scale Digital Calculating Machinery, Oak Ridge, TN, USA."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1093\/comjnl\/1.2.83","article-title":"A Modified Congruence Method of Generating Pseudo-random Numbers","volume":"1","author":"Thomson","year":"1958","journal-title":"Comput. J."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/321008.321019","article-title":"A New Pseudo-Random Number Generator","volume":"7","author":"Rotenberg","year":"1960","journal-title":"J. ACM"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"L\u2019Ecuyer, P. (2017, January 3\u20136). History of uniform random number generation. Proceedings of the WSC 2017\u2014Winter Simulation Conference, Las Vegas, NV, USA.","DOI":"10.1109\/WSC.2017.8247790"},{"key":"ref_33","unstructured":"Tomassini, M. (2005). Spatially Structured Evolutionary Algorithms: Artificial Evolution in Space and Time, Springer."},{"key":"ref_34","first-page":"657","article-title":"Cellular automata","volume":"4","author":"Kudryavtsev","year":"2006","journal-title":"Intellect. Syst."},{"key":"ref_35","first-page":"129","article-title":"Gedanken-experiments on Sequential Machines","volume":"34","author":"Moore","year":"1956","journal-title":"Autom. Stud."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0196-8858(86)90028-X","article-title":"Random sequence generation by cellular automata","volume":"7","author":"Wolfram","year":"1986","journal-title":"Adv. Appl. Math."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Ilachinski, A. (2001). Cellular Automata: A Discrete Universe, World Scientific.","DOI":"10.1142\/4702"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/12.888056","article-title":"On the generation of high-quality random numbers by two-dimensional cellular automata","volume":"49","author":"Tomassini","year":"2000","journal-title":"IEEE Trans. Comput."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S1568-4946(01)00015-1","article-title":"Cryptography with cellular automata","volume":"1","author":"Tomassini","year":"2001","journal-title":"Appl. Soft Comput."},{"key":"ref_40","unstructured":"Weisstein, E.W. (2019, July 31). Von Neumann Neighborhood. MathWorld\u2014A Wolfram Web Resource. Available online: http:\/\/mathworld.wolfram.com\/vonNeumannNeighborhood.html."},{"key":"ref_41","unstructured":"Weisstein, E.W. (2019, August 08). Moore Neighborhood. MathWorld\u2014A Wolfram Web Resource. Available online: http:\/\/mathworld.wolfram.com\/MooreNeighborhood.html."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.ic.2012.02.008","article-title":"Non-uniform cellular automata: Classes, dynamics, and decidability","volume":"215","author":"Dennunzio","year":"2012","journal-title":"J. Inf. Comput."},{"key":"ref_43","first-page":"2","article-title":"Cellular Automat","volume":"9","author":"Wolfram","year":"1983","journal-title":"Los Alamos Sci."},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Bassham, L., Rukhin, A., Soto, J., Nechvatal, J., Smid, M., Leigh, S., Levenson, M., Vangel, M., Heckert, N., and Banks, D. (2010). A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, National Institute of Standards and Technology. Special Publication (NIST SP).","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"47","DOI":"10.21681\/2311-3456-2017-4-47-66","article-title":"Cellular Automata in Cryptography. Part 2","volume":"4","author":"Zhukov","year":"2017","journal-title":"Voprosy kiberbezopasnosti"},{"key":"ref_46","unstructured":"Rogawski, M. (2022, March 06). Hardware Evaluation of eSTREAM Candidates: Grain, Lex, Mickey128, Salsa20 and Trivium. The eSTREAM Project. Available online: https:\/\/www.ecrypt.eu.org\/stream\/papersdir\/2007\/025.pdf."},{"key":"ref_47","unstructured":"Gurkaynak, F., Luethi, P., Bernold, N., Blattmann, R., Goode, V., Marghitola, M., Kaeslin, H., Felber, N., and Fichtner, W. (2022, February 02). Hardware Evaluation of eSTREAM Candidates: Achterbahn, Grain, MICKEY, MOSQUITO, SFINKS, Trivium, VEST, ZK-Crypt. The eSTREAM Project. Available online: https:\/\/www.ecrypt.eu.org\/stream\/papersdir\/2006\/015.pdf."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"3754","DOI":"10.1109\/TII.2018.2815985","article-title":"A Hardware and Secure Pseudorandom Generator for Constrained Devices","volume":"14","author":"Bakiri","year":"2018","journal-title":"IEEE Trans. Ind. Inform."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"1628","DOI":"10.1109\/TCSI.2017.2754650","article-title":"CIPRNG: A VLSI Family of Chaotic Iterations Post-Processings for F2\u2014Linear Pseudorandom Number Generation Based on Zynq MPSoC","volume":"65","author":"Bakiri","year":"2018","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s12095-021-00535-6","article-title":"Attacking the linear congruential generator on ellipticcurves via lattice techniques","volume":"14","author":"Gutierrez","year":"2021","journal-title":"Cryptogr. Commun."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Nannipieri, P., Di Matteo, S., Baldanzi, L., Crocetti, L., Belli, J., Fanucci, L., and Saponara, S. (2021). True Random Number Generator Based on Fibonacci-Galois Ring Oscillators for FPGA. Appl. Sci., 11.","DOI":"10.3390\/app11083330"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Badra, M., Guillet, T., and Serhrouchni, A. (2009, January 20\u201323). Random values, nonce and challenges: Semantic meaning versus opaque and strings of data. Proceedings of the 2009 IEEE 70th Vehicular Technology Conference Fall, Anchorage, AK, USA.","DOI":"10.1109\/VETECF.2009.5378957"},{"key":"ref_53","unstructured":"Sachin, D. (2005). Comparison of LFSR and CA for BIST. Comput. Sci., Available online: https:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.146.4514."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/9\/1869\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:24:49Z","timestamp":1760142289000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/9\/1869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,7]]},"references-count":53,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["sym14091869"],"URL":"https:\/\/doi.org\/10.3390\/sym14091869","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202208.0016.v1","asserted-by":"object"}]},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,7]]}}}