{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:27Z","timestamp":1742913387353,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030480059"},{"type":"electronic","value":"9783030480066"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-48006-6_18","type":"book-chapter","created":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T10:03:21Z","timestamp":1590141801000},"page":"258-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Randomness Tests: Theory and Practice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8605-7734","authenticated-orcid":false,"given":"Alexander","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,23]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/00031305.2016.1154108","volume":"70","author":"RL Wasserstein","year":"2016","unstructured":"Wasserstein, R.L., Lazar, N.A.: Editorial: the ASA\u2019s statement on p-values: context, process, and purpose. Am. Stat. 70(2), 129\u2013133 (2016). \nhttps:\/\/doi.org\/10.1080\/00031305.2016.1154108","journal-title":"Am. Stat."},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1038\/s41562-017-0189-z","volume":"2","author":"DJ Benjamin","year":"2018","unstructured":"Benjamin, D.J., et al.: Redefine statistical significance. Nat. Hum. Behav. 2, 6\u201310 (2018)","journal-title":"Nat. Hum. Behav."},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1134\/S0081543811060058","volume":"274","author":"Laurent Bienvenu","year":"2011","unstructured":"Bienvenu, L., G\u00e1acs, P., Hoyrup, M., Rojas, C., Shen, A.: Algorithmic tests and randomness with respect to a class of measures. Proc. Steklov Inst. Math. 274, 34\u201389 (2011). \nhttp:\/\/arxiv.org\/abs\/1103.1529","journal-title":"Proceedings of the Steklov Institute of Mathematics"},{"issue":"4","key":"18_CR4","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"Manuel Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of random bits. SIAM J. Comput. 13(4), 850\u2013864 (1984). \nhttps:\/\/doi.org\/10.1137\/0213053\n\n. (preliminary version was presented at FOCS 1982 conference)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR5","unstructured":"Borel, \u00c9.: Le Hasard. Librarire F\u00e9lix Alcan (1920)"},{"key":"18_CR6","unstructured":"Brown, R.G.: Dieharder: a GNU public random generator, version 3.31.1. Technical report, Duke University Physics Department (2006\u20132018). \nhttp:\/\/www.phy.duke.edu\/~rgb\/General\/dieharder.php"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.spl.2010.10.013","volume":"81","author":"AP David","year":"2011","unstructured":"David, A.P., de Rooij, S., Shafer, G., Shen, A., Vereshchagin, N., Vovk, V.: Insuring against loss of evidence in game-theoretic probability. Stat. Probab. Lett. 81, 157\u2013162 (2011). \nhttps:\/\/doi.org\/10.1016\/j.spl.2010.10.013","journal-title":"Stat. Probab. Lett."},{"key":"18_CR8","unstructured":"Davies, R.: Hardware random number generators. Technical report, Statistics Research Associates Limited (2000). \nhttp:\/\/robertnz.net\/hwrng.htm\n\n. Presented at 15th Australian Statistics Conference, July 2000, and 51st Conference of New Zealand Statistical Association, September 2000"},{"issue":"1-2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11225-012-9375-1","volume":"100","author":"Yuri Gurevich","year":"2012","unstructured":"Gurevich, Y., Passmore, G.O.: Impugning randomness, convincingly. Studia Logica 100(1\u20132), 193\u2013222 (2012). \nhttps:\/\/link.springer.com\/article\/10.1007\/s11225-012-9375-1\n\n. See also \nhttps:\/\/arxiv.org\/pdf\/1601.00665.pdf\n\n, \nhttps:\/\/www.cl.cam.ac.uk\/~gp351\/Gurevich-Passmore-IRC.pdf","journal-title":"Studia Logica"},{"key":"18_CR10","unstructured":"Gurevich, Y., Vovk, V.: Test statistics and p-values. Technical report, arXiv (2017). Working paper #16, On-line compression modelling project (new series). \nhttp:\/\/www.alrw.net\/articles\/16.pdf\n\n. See also \nhttps:\/\/arxiv.org\/pdf\/1702.02590.pdf"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). \nhttps:\/\/doi.org\/10.1137\/S0097539793244708","journal-title":"SIAM J. Comput."},{"key":"18_CR12","unstructured":"Kim, S.Y., Umeno, K., Hasegava, A.: Corrections of the NIST statistical test suite for randomness. Technical report (2004). \nhttps:\/\/eprint.iacr.org\/2004\/018.pdf"},{"key":"18_CR13","unstructured":"Kireev, A.: On the falsified results of the \u201creferendum\u201d in Sevastopol (in Russian). Technical report, LiveJournal, November 2014. \nhttps:\/\/kireev.livejournal.com\/1095568.html"},{"key":"18_CR14","volume-title":"The Art of Computer Programming. Seminumerical Algorithms","author":"D Knuth","year":"1981","unstructured":"Knuth, D.: The Art of Computer Programming. Seminumerical Algorithms, vol. 2, 2nd edn. Addison-Wesley, Boston (1981). ISBN 0-201-03822-6","edition":"2"},{"key":"18_CR15","unstructured":"Kupriyanov, A.: Gauss against Churov: preliminary conclusions. Technical report, Troitsky variant (Russian newspaper), May 2018. \nhttps:\/\/trv-science.ru\/2018\/05\/08\/gauss-protiv-churova-promezhutochnyj-itog"},{"key":"18_CR16","unstructured":"Marsaglia, G.: A current view of random number generators. In: Computer Science and Statistics, Sixteenth Symposium on the Interface, pp. 3\u201310. Elsevier, North-Holland (1985)"},{"key":"#cr-split#-18_CR17.1","unstructured":"Marsaglia, G.: Random numbers CDROM including the Diehard battery of tests of randomness. Technical report, University of Florida (1995).  http:\/\/stat.fsu.edu\/pub\/diehard\/  , was available at  http:\/\/stat.fsu.edu\/pub\/diehard\/"},{"key":"#cr-split#-18_CR17.2","unstructured":"now (2019) still available as snapshots from  https:\/\/web.archive.org  . Contains the preprint version of [16, 19]"},{"key":"18_CR18","unstructured":"Marsaglia, G., Tsang, W.W.: Some difficult-to-pass tests of randomness. J. Stat. Softw. 7(3) (2002). \nhttps:\/\/www.jstatsoft.org\/article\/view\/v007i03"},{"issue":"9","key":"18_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(93)90001-C","volume":"26","author":"G Marsaglia","year":"1993","unstructured":"Marsaglia, G., Zaman, A.: Monkey tests for random number generators. Comput. Math. Appl. 26(9), 1\u201310 (1993)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00193563","volume":"5","author":"Ueli M. Maurer","year":"1992","unstructured":"Maurer, U.M.: A universal statistical test for random bit generators. J. Cryptol. 5(2), 89\u2013105 (1992). \nhttps:\/\/link.springer.com\/article\/10.1007\/BF00193563","journal-title":"Journal of Cryptology"},{"key":"18_CR21","unstructured":"Rukhin, A., et al.: A statistical test suite for random and pseudorandom number generators for cryptographic applications, revision 1 by Lawrence E. Bassham III. Special Publication 800-22-1a, National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce (NIST), April 2010. \nhttps:\/\/www.nist.gov\/publications\/statistical-test-suite-random-and-pseudorandom-number-generators-cryptographic\n\n. Previous version seems to be unavailable at this site, but the review of Elaine B. Barker, ITL Bulletin (December 2000, 3 pp.), is available at \nhttps:\/\/tsapps.nist.gov\/publication\/get_pdf.cfm?pub_id=151231\n\n. The Lempel\u2013Ziv test, criticised in [12], was there (#10) according to the review; it is missing in the updated version"},{"key":"18_CR22","unstructured":"Barker, E., Kelsey, J.: Recommendation for random number generation using deterministic random bit generators. Special Publication 800-90A, National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce (NIST), June 2015. \nhttps:\/\/csrc.nist.gov\/publications\/detail\/sp\/800-90a\/rev-1\/final\n\n. Previous Version: January 2012"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Turan, M.S., Barker, E., Kelsey, J., McKay, K., Baish, M., Boyle, M.: Recommendation for the entropy sources used for random bit generation. Special Publication 800-90B, National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce (NIST), January 2018. \nhttps:\/\/csrc.nist.gov\/publications\/detail\/sp\/800-90b\/final","DOI":"10.6028\/NIST.SP.800-90B"},{"key":"18_CR24","unstructured":"Barker, E., Kelsey, J.: Recommendation for random bit generator (RBG) constructions (second draft). Special Publication 800-90C, National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce (NIST), April 2016. \nhttps:\/\/csrc.nist.gov\/CSRC\/media\/Publications\/sp\/800-90c\/draft\/documents\/sp800_90c_second_draft.pdf"},{"key":"18_CR25","unstructured":"Dang, Q.: Recommendation for applications using approved hash algorithms, revision 1. Special Publication 800-107r1, National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce (NIST), August 2012. \nhttps:\/\/nvlpubs.nist.gov\/nistpubs\/Legacy\/SP\/nistspecialpublication800-107r1.pdf"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-319-58741-7_32","volume-title":"Unveiling Dynamics and Complexity","author":"G Novikov","year":"2017","unstructured":"Novikov, G.: Randomness deficiencies. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 338\u2013350. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-58741-7_32"},{"key":"18_CR27","unstructured":"RAND Corporation: A Million Random Digits with 100,000 Normal Deviates. Free Press (1955). Reissued in 2001 as ISBN 0-8330-3047-7"},{"key":"18_CR28","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: A note on extracting randomness from Santha\u2013Vazirani sources. Technical report, available from Reingold (2014). \nhttps:\/\/omereingold.files.wordpress.com\/2014\/10\/svsources.pdf"},{"key":"18_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0022-0000(86)90044-9","volume":"33","author":"M Santha","year":"1986","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from semi-random sources. J. Comput. Syst. Sci. 33, 75\u201387 (1986). \nhttps:\/\/doi.org\/10.1016\/0022-0000(86)90044-9","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-21852-6_7","volume-title":"Measures of Complexity","author":"A Shen","year":"2015","unstructured":"Shen, A.: Around Kolmogorov complexity: basic notions and results. In: Vovk, V., Papadopoulos, H., Gammerman, A. (eds.) Measures of Complexity, pp. 75\u2013115. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21852-6_7"},{"key":"18_CR31","unstructured":"Shen, A.: Election and statistics: the case of \u201cUnited Russia\u201d, 2009\u20132018 (in Russian), preprint (2018). \nhttps:\/\/arxiv.org\/abs\/1204.0307"},{"key":"18_CR32","unstructured":"Shen, A.: Making randomness tests more robust. Technical report, HAL, February 2018. \nhttps:\/\/hal.archives-ouvertes.fr\/hal-01707610"},{"key":"18_CR33","unstructured":"Shen, A., Uspensky, V.A., Vereshchagin, N.K.: Kolmogorov Complexity and Algorithmic Randomness. American Mathematical Society (2017). \nhttp:\/\/www.lirmm.fr\/~ashen\/kolmbook-eng-scan.pdf"},{"key":"18_CR34","unstructured":"Stoppard, T.: Rosencrantz and Guildenstern Are Dead, a Play (1966). Grove Press (1971). ISBN 978-0-8021-3275-8"},{"key":"18_CR35","unstructured":"TrueRNG: TrueRNG documentation. Technical report, Ubld.it (2019). \nhttp:\/\/ubld.it\/truerng_v3"},{"key":"18_CR36","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-21852-6_17","volume-title":"Measures of Complexity","author":"N Vereshchagin","year":"2015","unstructured":"Vereshchagin, N., Shen, A.: Algorithmic statistics revisited. In: Vovk, V., Papadopoulos, H., Gammerman, A. (eds.) Measures of Complexity, pp. 235\u2013252. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21852-6_17\n\n. \nhttps:\/\/arxiv.org\/abs\/1504.04950v2"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/978-3-319-50062-1_41","volume-title":"Computability and Complexity","author":"N Vereshchagin","year":"2017","unstructured":"Vereshchagin, N., Shen, A.: Algorithmic statistics: forty years later. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds.) Computability and Complexity. LNCS, vol. 10010, pp. 669\u2013737. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50062-1_41\n\n. \nhttps:\/\/arxiv.org\/abs\/1607.08077"},{"key":"18_CR38","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 80\u201391 (1982). \nhttp:\/\/ieeexplore.ieee.org\/document\/4568378\/"}],"container-title":["Lecture Notes in Computer Science","Fields of Logic and Computation III"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48006-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T10:07:43Z","timestamp":1590142063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48006-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030480059","9783030480066"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48006-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}