{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:37:37Z","timestamp":1775018257335,"version":"3.50.1"},"reference-count":31,"publisher":"Pleiades Publishing Ltd","issue":"8","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1134\/s0361768825700409","type":"journal-article","created":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T10:50:55Z","timestamp":1772189455000},"page":"524-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New Statistically Secure Pseudorandom Sequence Generation Methods"],"prefix":"10.1134","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6358-1776","authenticated-orcid":false,"given":"M.","family":"Arkhipov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5029-5212","authenticated-orcid":false,"given":"A.","family":"Tchernykh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7066-0061","authenticated-orcid":false,"given":"M.","family":"Babenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8117-9142","authenticated-orcid":false,"given":"M.","family":"Lapina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5825-2433","authenticated-orcid":false,"given":"Reyes","family":"Ju\u00e1rez-Ram\u00edrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2026,2,27]]},"reference":[{"key":"3972_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/84537.84555","volume":"33","author":"P. L\u2019Ecuyer","year":"1990","unstructured":"L\u2019Ecuyer, P., Random numbers for simulation, Commun. ACM, 1990, vol. 33, no. 10, pp. 85\u201397. https:\/\/doi.org\/10.1145\/84537.84555","journal-title":"Commun. ACM"},{"key":"3972_CR2","doi-asserted-by":"publisher","unstructured":"Yu, F., Li, L., Tang, Q., Cai, Sh., Song, Yu., and Xu, Q., A survey on true random number generators based on chaos, Discrete Dyn. Nat. Soc., 2019, vol. 2019, no. 1, p.\u00a02545123. https:\/\/doi.org\/10.1155\/2019\/2545123","DOI":"10.1155\/2019\/2545123"},{"key":"3972_CR3","volume-title":"The Art of Computer Programming: Seminumerical Algorithms","author":"D.E. Knuth","year":"2014","unstructured":"Knuth, D.E., The Art of Computer Programming: Seminumerical Algorithms, Addison-Wesley, 2014, vol. 2."},{"key":"3972_CR4","doi-asserted-by":"publisher","unstructured":"Bhattacharjee, K. and Das, S., A search for good pseudo-random number generators: Survey and empirical studies, Comput. Sci. Rev., 2022, vol. 45, p. 100471. https:\/\/doi.org\/10.1016\/j.cosrev.2022.100471","DOI":"10.1016\/j.cosrev.2022.100471"},{"key":"3972_CR5","unstructured":"Dahiya, P., Shumailov, I., and Anderson, R., Machine learning needs better randomness standards: Randomised smoothing and PRNG-based attacks, 33rd USENIX Security Symposium (USENIX Security 24), 2024, pp. 3657\u20133674."},{"key":"3972_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/s0167-8191(02)00163-1","volume":"29","author":"A. Srinivasan","year":"2003","unstructured":"Srinivasan, A., Mascagni, M., and Ceperley, D., Testing parallel random number generators, Parallel Comput., 2003, vol. 29, no. 1, pp. 69\u201394. https:\/\/doi.org\/10.1016\/s0167-8191(02)00163-1","journal-title":"Parallel Comput."},{"key":"3972_CR7","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/tvlsi.2010.2103332","volume":"20","author":"C.-Y. Li","year":"2011","unstructured":"Li, C.-Y., Chen, Y.-H., Chang, T.-Y., Deng, L.-Y., and To, K., Period extension and randomness enhancement using high-throughput reseeding-mixing PRNG, IEEE Trans. Very Large Scale Integr. (VLSI) Syst., 2011, vol. 20, no. 2, pp. 385\u2013389. https:\/\/doi.org\/10.1109\/tvlsi.2010.2103332","journal-title":"Syst."},{"key":"3972_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto, M. and Nishimura, T., Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator, ACM Transactions on Modeling and Computer Simulation (TOMACS), 1998, vol.\u00a08, no. 1, pp. 3\u201330. https:\/\/doi.org\/10.1145\/272991.272995","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"key":"3972_CR9","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1145\/3453159","volume":"54","author":"P. Kietzmann","year":"2021","unstructured":"Kietzmann, P., Schmidt, T.C., and W\u00e4hlisch, M., A guideline on pseudorandom number generation (PRNG) in the IoT, ACM Comput. Surv., 2021, vol. 54, no. 6, p. 112. https:\/\/doi.org\/10.1145\/3453159","journal-title":"ACM Comput. Surv."},{"key":"3972_CR10","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1109\/access.2015.2432140","volume":"3","author":"S.L. Hong","year":"2015","unstructured":"Hong, S.L. and Liu, Ch., Sensor-based random number generator seeding, IEEE Access, 2015, vol. 3, pp.\u00a0562\u2013568. https:\/\/doi.org\/10.1109\/access.2015.2432140","journal-title":"IEEE Access"},{"key":"3972_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.3390\/sym14010068","volume":"14","author":"S. Haliuk","year":"2022","unstructured":"Haliuk, S., Krulikovskyi, O., Vovchuk, D., and Corinto, F., Memristive structure-based chaotic system for PRNG, Symmetry, 2022, vol. 14, no. 1, p. 68. https:\/\/doi.org\/10.3390\/sym14010068","journal-title":"Symmetry"},{"key":"3972_CR12","doi-asserted-by":"publisher","unstructured":"Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., Dray, J., and Vo, S., A statistical test suite for random and pseudorandom number generators for cryptographic applications, NIST Special Publication 800-22, Gaithersburg, MD: National Institute of Standards and Technology, 2001. https:\/\/doi.org\/10.6028\/nist.sp.800-22","DOI":"10.6028\/nist.sp.800-22"},{"key":"3972_CR13","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., and Vo, S., A statistical test suite for random and pseudorandom number generators for cryptographic applications, Special Publication 800-22, Gaithersburg, MD: National Institute of Standards and Technology, 2010. https:\/\/doi.org\/10.6028\/nist.sp.800-22r1a","DOI":"10.6028\/nist.sp.800-22r1a"},{"key":"3972_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-82865-2_4","volume-title":"Statistical tests for PRNGs, Random Number Generators: Verilog Description, Hardware Implementation and Applications","author":"L.G. de la Fraga","year":"2025","unstructured":"de la Fraga, L.G., Rodr\u00edguez-Mu\u00f1oz, J.D., and Tlelo-Cuautle, E., Statistical tests for PRNGs, Random Number Generators: Verilog Description, Hardware Implementation and Applications, Cham: Springer, 2025, pp.\u00a083\u201393. https:\/\/doi.org\/10.1007\/978-3-031-82865-2_4"},{"key":"3972_CR15","doi-asserted-by":"publisher","unstructured":"Katzgraber, H.G., Random numbers in scientific computing: An introduction, arXiv Preprint, 2010. https:\/\/doi.org\/10.48550\/arXiv.1005.4117","DOI":"10.48550\/arXiv.1005.4117"},{"key":"3972_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/3047307","volume":"50","author":"L. Chi","year":"2017","unstructured":"Chi, L. and Zhu, X., Hashing techniques: A survey and taxonomy, ACM Comput. Surv., 2017, vol. 50, no. 1, p.\u00a011. https:\/\/doi.org\/10.1145\/3047307","journal-title":"ACM Comput. Surv."},{"key":"3972_CR17","doi-asserted-by":"publisher","first-page":"8602","DOI":"10.1038\/s41598-022-11613-x","volume":"12","author":"C. Ryan","year":"2022","unstructured":"Ryan, C., Kshirsagar, M., Vaidya, G., Cunningham, A., and Sivaraman, R., Design of a cryptographically secure pseudo random number generator with grammatical evolution, Sci. Rep., 2022, vol. 12, no. 1, p.\u00a08602. https:\/\/doi.org\/10.1038\/s41598-022-11613-x","journal-title":"Sci. Rep."},{"key":"3972_CR18","doi-asserted-by":"publisher","first-page":"166","DOI":"10.3390\/e25010166","volume":"25","author":"W. Zhao","year":"2023","unstructured":"Zhao, W., Chang, Zh., Ma, C., and Shen, Zh., A pseudorandom number generator based on the chaotic map and quantum random walks, Entropy, 2023, vol. 25, no.\u00a01, p. 166. https:\/\/doi.org\/10.3390\/e25010166","journal-title":"Entropy"},{"key":"3972_CR19","unstructured":"O\u2019Neill, M.E., PCG: A family of simple fast space-efficient statistically good algorithms for random number generation, ACM Trans. Math. Software, 2014, p. 204."},{"key":"3972_CR20","doi-asserted-by":"publisher","unstructured":"Kelsey, J., Change, S.-J., and Perlner, R., SHA-3 derived functions: cSHAKE, KMAC, TupleHash and ParallelHash, NIST Special Publication 800-185, National Institute of Standards and Technology, 2016. https:\/\/doi.org\/10.6028\/nist.sp.800-185","DOI":"10.6028\/nist.sp.800-185"},{"key":"3972_CR21","unstructured":"O\u2019Connor, J. et al., Black3 one function, fast everywhere, 2025. \nhttps:\/\/github.com\/BLAKE3-team\/BLAKE3-specs\/blob\/master\/blake3.pdf. Cited April 14, 2025."},{"key":"3972_CR22","doi-asserted-by":"publisher","unstructured":"Rivest, R.L., The MD5 message-digest algorithm, RFC Editor, 1992. https:\/\/doi.org\/10.17487\/rfc1321","DOI":"10.17487\/rfc1321"},{"key":"3972_CR23","unstructured":"GOST R (State Standard) 28640-2012: Statistical Methods. Random Number Generation, Moscow: Standartinform, 2014."},{"key":"3972_CR24","unstructured":"Klima, V., Tunnels in hash functions: MD5 collisions within a minute, Cryptology ePrint Archive, 2006."},{"key":"3972_CR25","doi-asserted-by":"publisher","first-page":"144574","DOI":"10.1109\/access.2021.3122466","volume":"9","author":"H. Choi","year":"2021","unstructured":"Choi, H. and Seo, S.Ch., Fast implementation of SHA-3 in GPU environment, IEEE Access, 2021, vol. 9, pp.\u00a0144574\u2013144586. https:\/\/doi.org\/10.1109\/access.2021.3122466","journal-title":"IEEE Access"},{"key":"3972_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.4213\/mvk146","volume":"6","author":"M.-J.O. Saarinen","year":"2015","unstructured":"Saarinen, M.-J.O., StriBob: Authenticated encryption from GOST R 34.11-2012 LPS permutation, Matematicheskie Voprosy Kriptografii, 2015, vol. 6, no. 2, pp.\u00a067\u201378. https:\/\/doi.org\/10.4213\/mvk146","journal-title":"Matematicheskie Voprosy Kriptografii"},{"key":"3972_CR27","doi-asserted-by":"publisher","unstructured":"Aslanyan, H., Gevorgyan, Zh., Mkoyan, R., Movsisyan, H., Sahakyan, V., and Sargsyan, S., Static analysis methods for memory leak detection: A survey, 2022 Ivannikov Memorial Workshop (IVMEM), Moscow, 2022, IEEE, 2022, pp. 1\u20136. https:\/\/doi.org\/10.1109\/ivmem57067.2022.9983955","DOI":"10.1109\/ivmem57067.2022.9983955"},{"key":"3972_CR28","doi-asserted-by":"publisher","unstructured":"Sargsyan, S., Kurmangaleev, Sh., Hakobyan, J., Mehrabyan, M., Asryan, S., and Movsisyan, H., Directed fuzzing based on program dynamic instrumentation, 2019 International Conference on Engineering Technologies and Computer Science (EnT), Moscow, 2019, IEEE, 2019, pp. 30\u201333. https:\/\/doi.org\/10.1109\/ent.2019.00011","DOI":"10.1109\/ent.2019.00011"},{"key":"3972_CR29","doi-asserted-by":"publisher","unstructured":"Avetisyan, A., Kurmangaleev, Sh., Sargsyan, S., Arutunian, M., and Belevantsev, A., LLVM-based code clone detection framework, 2015 Computer Science and Information Technologies (CSIT), Yerevan, 2015, IEEE, 2015, pp. 100\u2013104. https:\/\/doi.org\/10.1109\/csitechnol.2015.7358259","DOI":"10.1109\/csitechnol.2015.7358259"},{"key":"3972_CR30","doi-asserted-by":"publisher","unstructured":"Sargsyan, S., Hakobyan, J., Nersisyan, L., Sargsyan, K., and Melkonyan, V., Improving fuzzing efficiency based on extracted constant values, 2022 Ivannikov Ispras Open Conference (ISPRAS), Moscow, 2022, IEEE, 2022, pp. 81\u201385. https:\/\/doi.org\/10.1109\/ispras57371.2022.10076849","DOI":"10.1109\/ispras57371.2022.10076849"},{"key":"3972_CR31","doi-asserted-by":"publisher","unstructured":"Sargsyan, S., Hakobyan, J., Mehrabyan, M., Mkoyan, R., Sahakyan, V., Melkonyan, V., Arutunian, M., Fahradyan, A., and Avetisyan, A., Advanced grammar-based fuzzing, 2022 Ivannikov Memorial Workshop (IVMEM), Moscow, 2022, IEEE, 2022, pp. 61\u201364. https:\/\/doi.org\/10.1109\/ivmem57067.2022.9983953","DOI":"10.1109\/ivmem57067.2022.9983953"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768825700409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768825700409","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768825700409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:51:21Z","timestamp":1775011881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768825700409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["3972"],"URL":"https:\/\/doi.org\/10.1134\/s0361768825700409","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"17 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}