{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T19:23:47Z","timestamp":1763925827093,"version":"3.45.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032107589","type":"print"},{"value":"9783032107596","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T00:00:00Z","timestamp":1763942400000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-10759-6_9","type":"book-chapter","created":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T19:22:32Z","timestamp":1763925752000},"page":"140-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Random Data and\u00a0Its Cryptographic Applications"],"prefix":"10.1007","author":[{"given":"Ay\u015fe Eda","family":"Yavuzyi\u011fit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O\u011fuz","family":"Yayla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,24]]},"reference":[{"issue":"9","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum-redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23(3), 337\u2013343 (1977)","DOI":"10.1109\/TIT.1977.1055714"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27, 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"9_CR4","unstructured":"Fano, R.M.: The transmission of information, vol. 65. Massachusetts Institute of Technology, Research Laboratory of Electronics, Cambridge, MA, USA (1949)"},{"key":"9_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-072-8","volume-title":"A Concise Introduction to Data Compression","author":"D Salomon","year":"2008","unstructured":"Salomon, D.: A Concise Introduction to Data Compression. Springer, London (2008)"},{"key":"9_CR6","unstructured":"Gillis, J.A.: A method for recursive data compression. Pat (2018)"},{"key":"9_CR7","unstructured":"Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, vol. 2. Addison-Wesley Professional (2014)"},{"key":"9_CR8","unstructured":"Marsaglia, G.: The Marsaglia random number CDROM including the diehard battery of tests of randomness. http:\/\/www.stat.fsu.edu\/pub\/diehard\/ (2008)"},{"key":"9_CR9","unstructured":"Brown, R.G.: Dieharder: a random number test suite, https:\/\/webhome.phy.duke.edu\/rgb\/General\/dieharder.php (2013), Accessed 15 Sep 2022"},{"key":"9_CR10","unstructured":"Caelli, W.: Crypt x package documentation. Technical Report, Information Security Research (1992)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Bassham III, L.E., Rukhin, A.L., Soto, J., et al.: A statistical test suite for random and pseudorandom number generators for cryptographic applications, Technical Report, Sp 800-22 rev.1a, NIST, Gaithersburg, Md, USA (2010)","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"9_CR12","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), article22 (2007)","DOI":"10.1145\/1268776.1268777"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/11863854_15","volume-title":"Sequences and Their Applications \u2013 SETA 2006","author":"A Do\u011fanaksoy","year":"2006","unstructured":"Do\u011fanaksoy, A., G\u00f6lo\u011flu, F.: On lempel-Ziv complexity of sequences. In: Gong, G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp. 180\u2013189. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11863854_15"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Hamano, K., Yamamoto, H.: A randomness test based on T-complexity. IEICE Trans. Fund. Electr. Commun. Comput. Sci. 93(7), 1346\u20131354 (2010)","DOI":"10.1587\/transfun.E93.A.1346"},{"issue":"3","key":"9_CR15","first-page":"139","volume":"3","author":"AJ Maan","year":"2013","unstructured":"Maan, A.J.: Analysis and comparison of algorithms for lossless data compression. Int. J. Inf. Comput. Technol. 3(3), 139\u2013146 (2013)","journal-title":"Int. J. Inf. Comput. Technol."},{"key":"9_CR16","unstructured":"S\u00f6nmez Turan, M., Do\u011fanaksoy, A., Bozta\u015f, S.: On independence and sensitivity of statistical randomness tests. In: Sequences and Their Applications-SETA 2008: 5th International Conference Lexington, KY, USA, September 14-18, 2008 Proceedings 5. Springer, Berlin, Heidelberg (2008)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Rukhin, A., et al.: A statistical test suite for random and pseudorandom number generators for cryptographic applications. Gaithersburg, MD, USA: US Department of Commerce, Technology Administration, National Institute of Standards and Technology (2001)","DOI":"10.6028\/NIST.SP.800-22"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Do\u011fanaksoy, A., Sulak, F., U\u011fuz, M., \u015eeker, O., Akcengiz, Z.: New statistical randomness tests based on length of runs. Math. Probl. Eng. 2015(1), 626408 (2015)","DOI":"10.1155\/2015\/626408"},{"issue":"3","key":"9_CR19","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1080\/0161-110291890876","volume":"26","author":"W Stallings","year":"2002","unstructured":"Stallings, W.: The advanced encryption standard. Cryptologia 26(3), 165\u2013188 (2002)","journal-title":"Cryptologia"},{"issue":"5","key":"9_CR20","doi-asserted-by":"publisher","first-page":"3673","DOI":"10.3906\/elk-1605-212","volume":"25","author":"F Sulak","year":"2017","unstructured":"Sulak, F., U\u011fuz, M., Kocak, O., Do\u011fanaksoy, A.: On the independence of statistical randomness tests included in the NIST test suite. Turk. J. Electr. Eng. Comput. Sci. 25(5), 3673\u20133683 (2017)","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"9_CR21","volume-title":"Shift Register Sequences","author":"SW Golomb","year":"1982","unstructured":"Golomb, S.W.: Shift Register Sequences. Aegean Park Press, Laguna Hills, CA (1982)"},{"key":"9_CR22","unstructured":"Van T., Henk, C.A., Sushil, J. (eds.) Encyclopedia of cryptography and security. Vol. 1. Springer (2011)"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Stipcevic, M., Ko\u00e7, \u00c7.K.: True random number generators. Open problems in mathematics and computational science, pp. 275\u2013315. Springer International Publishing, Cham (2014)","DOI":"10.1007\/978-3-319-10683-0_12"}],"container-title":["Lecture Notes in Computer Science","Cyber Security, Cryptology, and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-10759-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,23]],"date-time":"2025-11-23T19:22:35Z","timestamp":1763925755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-10759-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,24]]},"ISBN":["9783032107589","9783032107596"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-10759-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,24]]},"assertion":[{"value":"24 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security, Cryptology, and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Be'er Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cscml.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}