{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:59Z","timestamp":1750306319555,"version":"3.41.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,1,6]],"date-time":"2016-01-06T00:00:00Z","timestamp":1452038400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Model. Comput. Simul."],"published-print":{"date-parts":[[2016,1,28]]},"abstract":"<jats:p>\n            In this article, we present MaD0, an ultrafast nonlinear pseudorandom number generator (PRNG) for noncryptographic applications. MaD0 uses byte-oriented operations for state initialization and fast integer-oriented operations for state transition and pseudorandom number generation. Its state transition follows a pseudorandom mapping. MaD0 generates high-quality pseudorandom numbers and reaches a generation speed of half cycle per byte on an Intel Core i3 processor. It has a state space of 2,240 bits and an expected period length around 2\n            <jats:sup>1120<\/jats:sup>\n            . It also shows other good properties, such as fast recovery from biased states and ease of use.\n          <\/jats:p>","DOI":"10.1145\/2856693","type":"journal-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T14:04:54Z","timestamp":1452175494000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["MaD0"],"prefix":"10.1145","volume":"26","author":[{"given":"Jie","family":"Li","sequence":"first","affiliation":[{"name":"Graduate Center, City University of New York"}]},{"given":"Jianliang","family":"Zheng","sequence":"additional","affiliation":[{"name":"Independent Scholar"}]},{"given":"Paula","family":"Whitlock","sequence":"additional","affiliation":[{"name":"Brooklyn College, City University of New York"}]}],"member":"320","published-online":{"date-parts":[[2016,1,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"edition":"3","volume-title":"Seminumerical Algorithms","author":"Knuth Donald E.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","unstructured":"Valentin Fedorovich Kolchin. 1986. Random Mappings. Springer.  Valentin Fedorovich Kolchin. 1986. Random Mappings. Springer."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1268776.1268777"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.50.6.1073.358"},{"volume-title":"Retrieved","year":"2009","author":"Leitner Felix V.","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","unstructured":"Jie Li. 2013. Ultrafast Pseudorandom Number Generation Using Pseudorandom Permutations and Mappings. P.h.D. Dissertation. Publication No. 3601931. City University of New York ProQuest\/UMI.  Jie Li. 2013. Ultrafast Pseudorandom Number Generation Using Pseudorandom Permutations and Mappings. P.h.D. Dissertation. Publication No. 3601931. City University of New York ProQuest\/UMI."},{"volume-title":"Course Technology. Retrieved","year":"2008","author":"Lomont Chris","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","unstructured":"George Marsaglia. 1995. The Marsaglia Random Number CDROM Including the Diehard Battery of Tests of Randomness. New version available at http:\/\/www.csis.hku.hk\/diehard\/.  George Marsaglia. 1995. The Marsaglia Random Number CDROM Including the Diehard Battery of Tests of Randomness. New version available at http:\/\/www.csis.hku.hk\/diehard\/."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v008.i14"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v007.i03"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/272991.272995"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.1998.10480597"},{"key":"e_1_2_1_14_1","first-page":"180","article-title":"Secure Hash Standard (SHS). National Institute of Standards and Technology","author":"National Institute of Standards and Technology.","year":"2008","journal-title":"Federal Information Processing Standards Publication"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132973.1132974"},{"key":"e_1_2_1_16_1","first-page":"800","article-title":"A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications","author":"Rukhin Andrew","year":"2001","journal-title":"NIST Special Publication"},{"volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","year":"2006","author":"Saito Mutsuo","key":"e_1_2_1_17_1"},{"key":"e_1_2_1_18_1","unstructured":"Brouce Schneier. 1996. Applied Cryptography. Protocols Algorithms and Source Code in C. John Wiley & Sons.   Brouce Schneier. 1996. Applied Cryptography. Protocols Algorithms and Source Code in C. John Wiley & Sons."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00003816"},{"volume":"218","volume-title":"Proceedings. Lecture Notes in Computer Science","author":"Webster A. F.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37119-6_3"}],"container-title":["ACM Transactions on Modeling and Computer Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2856693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2856693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:13Z","timestamp":1750222453000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2856693"}},"subtitle":["An Ultrafast Nonlinear Pseudorandom Number Generator"],"short-title":[],"issued":{"date-parts":[[2016,1,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,1,28]]}},"alternative-id":["10.1145\/2856693"],"URL":"https:\/\/doi.org\/10.1145\/2856693","relation":{},"ISSN":["1049-3301","1558-1195"],"issn-type":[{"type":"print","value":"1049-3301"},{"type":"electronic","value":"1558-1195"}],"subject":[],"published":{"date-parts":[[2016,1,6]]},"assertion":[{"value":"2015-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-01-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}