{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:58:39Z","timestamp":1742936319314,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031540523"},{"type":"electronic","value":"9783031540530"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-54053-0_7","type":"book-chapter","created":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T05:02:22Z","timestamp":1710565342000},"page":"84-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Implemented Graph-Based Generator of Cryptographically Strong Pseudorandom Sequences of Multivariate Nature"],"prefix":"10.1007","author":[{"given":"Vasyl","family":"Ustimenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tymoteusz","family":"Chojecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,17]]},"reference":[{"key":"7_CR1","unstructured":"Schneier, B.: Applied Cryptography, Second Edition: Protocols, Algorthms, and Source Code in C. Wiley 784 p."},{"key":"7_CR2","unstructured":"Boneh, D., Shoup, V.: A Graduate Course in Applied Cryptography, Stanford University, free on-line course"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-030-63115-4_12","volume-title":"Modern Cryptography: Applied Mathematics for Encryption and Information Security","author":"W Easttom","year":"2021","unstructured":"Easttom, W.: Random number generators. In: Easttom, W. (ed.) Modern Cryptography: Applied Mathematics for Encryption and Information Security, pp. 257\u2013276. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-63115-4_12"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Grozov, V., Guirik, A., Budko, M., Budko, M.: Development of a Pseudo-Random Sequence Generation Function Based on the Cryptographic Algorithm \u201cKuznechik.\u201d Proceedings of the 12th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT 2020), Czech Republic, pp. 93\u201398 (2020). https:\/\/doi.org\/10.1109\/ICUMT51630.2020.9222457","DOI":"10.1109\/ICUMT51630.2020.9222457"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2016.07.042","volume":"647","author":"\u013d Balkov\u00e1","year":"2016","unstructured":"Balkov\u00e1, \u013d, Bucci, M., De Luca, A., Hladk\u00fd, J., Puzynina, S.: Aperiodic pseudorandom number generators based on infinite words. Theor. Comput. Sci. 647, 85\u2013100 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.07.042","journal-title":"Theor. Comput. Sci."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1017\/CBO9781139696456.012","volume-title":"Applied Algebra and Number Theory","author":"J Kaszi\u00e1n","year":"2014","unstructured":"Kaszi\u00e1n, J., Moree, P., Shparlinski, I.E.: Periodic structure of the exponential pseudorandom number generator. In: Larcher, G., Pillichshammer, F., Winterhof, A., Xing, C. (eds.) Applied Algebra and Number Theory, pp. 190\u2013203. Cambridge University Press (2014). https:\/\/doi.org\/10.1017\/CBO9781139696456.012"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Panneton, F., L\u2019Ecuyer, P., Matsumoto, M.: Improved long-period generators based on linear recurrences modulo 2. ACM Trans. Math. Software 32, 1\u201316 (2006)","DOI":"10.1145\/1132973.1132974"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J Hastad","year":"1999","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A Pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"7_CR9","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/12.589245","volume":"46","author":"S Blackburn","year":"1997","unstructured":"Blackburn, S., Murphy, S., Paterson, K.G.: Comments on \u201cTheory and applications of cellular automata in cryptography\u201d [with reply]. IEEE Trans. Comput. 46(5), 637\u2013639 (1997). https:\/\/doi.org\/10.1109\/12.589245","journal-title":"IEEE Trans. Comput."},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2009.10.015","author":"RS Wikramaratna","year":"2009","unstructured":"Wikramaratna, R.S.: Theoretical and empirical convergence results for additive congruential random number generators. J. Comput. Appl. Math. (2009). https:\/\/doi.org\/10.1016\/j.cam.2009.10.015","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/RevModPhys.89.015004","volume":"89","author":"M Herrero-Collantes","year":"2016","unstructured":"Herrero-Collantes, M., Garcia-Escartin, J.C.: Quantum random number generators. Rev. Mod. Phys. 89(1), 1\u201354 (2016). https:\/\/doi.org\/10.1103\/RevModPhys.89.015004","journal-title":"Rev. Mod. Phys."},{"key":"7_CR12","doi-asserted-by":"publisher","DOI":"10.1515\/9781501506062","volume-title":"Random number generators \u2013 principles and practices","author":"D Johnston","year":"2018","unstructured":"Johnston, D.: Random number generators \u2013 principles and practices. DeG Press, A guide for engineers and programmers (2018)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","volume":"32","author":"F Lazebnik","year":"1995","unstructured":"Lazebnik, F., Ustimenko, V.A., Woldar, A.J.: A new series of dense graphs of high girth. Bull. Am. Math. Soc. 32(1), 73\u201379 (1995). https:\/\/doi.org\/10.1090\/S0273-0979-1995-00569-0","journal-title":"Bull. Am. Math. Soc."},{"key":"7_CR14","unstructured":"Ustimenko, V.A.: On the extremal graph theory and symbolic computations. Dopovidi National Academy of Science, No. 2, pp. 42\u201349. Ukraine (2013)"},{"key":"7_CR15","first-page":"198","volume-title":"Graphs in terms of Algebraic Geometry, symbolic computations and secure communications in Post-Quantum world","author":"V Ustimenko","year":"2022","unstructured":"Ustimenko, V.: Graphs in terms of Algebraic Geometry, symbolic computations and secure communications in Post-Quantum world, p. 198. University of Maria Curie Sklodowska Editorial House, Lublin (2022)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-030-22868-2_47","volume-title":"Intelligent Computing: Proceedings of the 2019 Computing Conference, Volume 2","author":"V Ustimenko","year":"2019","unstructured":"Ustimenko, V., Klisowski, M.: On non-commutative cryptography with cubical multivariate maps of predictable density. In: Arai, K., Bhatia, R., Kapoor, S. (eds.) Intelligent Computing: Proceedings of the 2019 Computing Conference, Volume 2, pp. 654\u2013674. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22868-2_47"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Ustimenko, V., Klisowski, M.: On D(n; q) quotients of large girth and hidden homomorphism based cryptographic protocols. In: Ganzha, M., Maciaszek, L.,\u00a0Paprzycki, M.,\u00a0\u015al\u0119zak, D. (eds). Communication Papers of the 17th Conference on Computer Science and Intelligence Systems, ACSIS, vol.\u00a032, pp.\u00a0199\u2013206\u00a0(2022).\u00a0https:\/\/doi.org\/10.15439\/2022F54","DOI":"10.15439\/2022F54"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Ustimenko, V.: On new symbolic key exchange protocols and cryptosystems based on a hidden tame homomorphism, Dopovidi National Academy of Scince, n. 10, pp. 26\u201336. Ukraine (2018)","DOI":"10.15407\/dopovidi2018.10.026"},{"key":"7_CR19","unstructured":"Ustimenko, V., Klisowski, M.: On Noncommutative Cryptography and homomorphism of stable cubical multivariate transformation groups of infinite dimensional affine spaces, Cryptology ePrint Archive, 2019\/593"},{"key":"7_CR20","unstructured":"Ustimenko, V.: On Extremal Algebraic Graphs and Multivariate Cryptosystems, Cryptology ePrint Archive, 2022\/593"},{"key":"7_CR21","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/177","volume-title":"Non-commutative Cryptography and Complexity of Group-theoretic Problems","author":"A Myasnikov","year":"2011","unstructured":"Myasnikov, A., Shpilrain, V., Ushakov, A.: Non-commutative Cryptography and Complexity of Group-theoretic Problems. American Mathematical Society, Providence, Rhode Island (2011)"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-14706-7_14","volume-title":"Computer Network Security","author":"DN Moldovyan","year":"2010","unstructured":"Moldovyan, D.N., Moldovyan, N.A.: A new hard problem over non-commutative finite groups for cryptographic protocols. In: Kotenko, I., Skormin, V. (eds.) Computer Network Security, pp. 183\u2013194. Springer Berlin Heidelberg, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14706-7_14"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Kahrobaei, D., Khan, AB.: non-commutative generalization of ElGamal key exchange using polycyclic groups. In: IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference [4150920]. https:\/\/doi.org\/10.1109\/GLOCOM.2006","DOI":"10.1109\/GLOCOM.2006"},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-013-9170-9","volume":"28","author":"B Tsaban","year":"2015","unstructured":"Tsaban, B.: Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography. J. Cryptol. 28(3), 601\u2013622 (2015)","journal-title":"J. Cryptol."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Roman'kov, V.A.: A nonlinear decomposition attack, Groups Complex. Cryptol. 8()2 197\u2013207.27 (2016)","DOI":"10.1515\/gcc-2016-0017"},{"key":"7_CR26","unstructured":"Bassham, L., et al.: A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications, Special Publication (NIST SP), National Institute of Standards and Technology, Gaithersburg, MD (2010). https:\/\/tsapps.nist.gov\/publication\/get_pdf.cfm?pub_id=906762. Accessed 8 May 2023"},{"issue":"3","key":"7_CR27","first-page":"412","volume":"140","author":"V Ustimenko","year":"2007","unstructured":"Ustimenko, V.: Linguistic Dynamical Systems, grasphs of large girth and cryptography. J. Math. Sci. Springer 140(3), 412\u2013434 (2007)","journal-title":"J. Math. Sci. Springer"}],"container-title":["Lecture Notes in Networks and Systems","Advances in Information and Communication"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54053-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T05:18:23Z","timestamp":1710566303000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54053-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031540523","9783031540530"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54053-0_7","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FICC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Future of Information and Communication Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ficc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/FICC","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}