{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:29:03Z","timestamp":1760171343989},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_34","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"425-437","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Statistical Testing of PRNG: Generalized Gambler\u2019s Ruin Problem"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Lorek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"S\u0142owik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Zag\u00f3rski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-89754-5_4","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"M Akg\u00fcn","year":"2008","unstructured":"Akg\u00fcn, M., Kavak, P., Demirci, H.: New results on the key scheduling algorithm of RC4. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 40\u201352. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89754-5_4"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"AlFardan, N., Bernstein, D.J., Paterson, K.G., Poettering, B., Schuldt, J.C.N.: On the security of RC4 in TLS. In: Presented as part of the 22nd USENIX Security Symposium (USENIX Security 13), Washington, D.C., pp. 305\u2013320. USENIX (2013)","DOI":"10.1109\/MPRV.2013.43"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-03515-4_20","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"S Banik","year":"2013","unstructured":"Banik, S., Sarkar, S., Kacker, R.: Security analysis of the RC4+ stream cipher. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 297\u2013307. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03515-4_20"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Barker, E., Kelsey, J.: DRAFT NIST Special Publication 800-90A, Rev. 1 - Recommendation for Random Number Generation Using Deterministic Random Bit Generators. Technical report, NIST (2014)","DOI":"10.6028\/NIST.SP.800-90Ar1"},{"key":"34_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-68351-3_8","volume-title":"New Stream Cipher Designs","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J.: The Salsa20 family of stream ciphers. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 84\u201397. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68351-3_8"},{"key":"34_CR6","unstructured":"Brown, R.G., Eddelbuettel, D., Bauer, D.: Dieharder: a random number test suite. www.phy.duke.edu\/~rgb\/General\/dieharder.php"},{"issue":"1","key":"34_CR7","first-page":"339","volume":"217","author":"H Ekkehard","year":"2010","unstructured":"Ekkehard, H., Gr\u00f8nvik, A.: Re-seeding invalidates tests of random number generators. Appl. Math. Comput. 217(1), 339\u2013346 (2010)","journal-title":"Appl. Math. Comput."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45537-X_1","volume-title":"Selected Areas in Cryptography","author":"S Fluhrer","year":"2001","unstructured":"Fluhrer, S., Mantin, I., Shamir, A.: Weaknesses in the key scheduling algorithm of RC4. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 1\u201324. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45537-X_1"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-319-49890-4_17","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2016","author":"S Jha","year":"2016","unstructured":"Jha, S., Banik, S., Isobe, T., Ohigashi, T.: Some proofs of joint distributions of keystream biases in RC4. In: Dunkelman, O., Sanadhya, S.K. (eds.) INDOCRYPT 2016. LNCS, vol. 10095, pp. 305\u2013321. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49890-4_17"},{"issue":"1","key":"34_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.cam.2004.04.005","volume":"174","author":"M Kang","year":"2005","unstructured":"Kang, M.: Efficiency test of pseudorandom number generators using random walks. J. Comput. Appl. Math. 174(1), 165\u2013177 (2005)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"34_CR11","first-page":"195","volume":"199","author":"C Kim","year":"2008","unstructured":"Kim, C., Choe, G.H., Kim, D.H.: Tests of randomness by the gambler\u2019s ruin algorithm. Appl. Math. Comput. 199(1), 195\u2013210 (2008)","journal-title":"Appl. Math. Comput."},{"issue":"4","key":"34_CR12","doi-asserted-by":"crossref","first-page":"22-es","DOI":"10.1145\/1268776.1268777","volume":"33","author":"P L\u2019Ecuyer","year":"2007","unstructured":"L\u2019Ecuyer, P., Simard, R.: TestU01: a C library for empirical testing of random number generators. ACM Trans. Math. Softw. 33(4), 22-es (2007)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"34_CR13","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/s11009-016-9507-6","volume":"19","author":"P Lorek","year":"2017","unstructured":"Lorek, P.: Generalized gambler\u2019s ruin problem: explicit formulas via Siegmund duality. Methodol. Comput. Appl. Prob. 19(2), 603\u2013613 (2017)","journal-title":"Methodol. Comput. Appl. Prob."},{"issue":"1","key":"34_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"34_CR15","unstructured":"Schuldt, J.C.N., Rivest, R.L.: Spritz\u2014a spongy RC4-like stream cipher and hash function. Technical report (2014)"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-25937-4_16","volume-title":"Fast Software Encryption","author":"S Paul","year":"2004","unstructured":"Paul, S., Preneel, B.: A new weakness in the RC4 keystream generator and an approach to improve the security of the cipher. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 245\u2013259. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_16"},{"key":"34_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-89754-5_3","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"S Maitra","year":"2008","unstructured":"Maitra, S., Paul, G.: Analysis of RC4 and proposal of additional layers for better security margin. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 27\u201339. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89754-5_3"},{"key":"34_CR18","unstructured":"Vanhoef, M., Piessens, F.: All your biases belong to us: breaking RC4 in WPA-TKIP and TLS. In: USENIX Security Symposium (2015)"},{"key":"34_CR19","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.cose.2015.05.005","volume":"53","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Nicol, T.: On statistical distance based testing of pseudo random sequences and experiments with PHP and Debian OpenSSL. Comput. Secur. 53, 44\u201364 (2015)","journal-title":"Comput. Secur."},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25937-4_14","volume-title":"Fast Software Encryption","author":"B Zoltak","year":"2004","unstructured":"Zoltak, B.: VMPC one-way function and stream cipher. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 210\u2013225. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_14"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T04:58:22Z","timestamp":1570510702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}