{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:58:43Z","timestamp":1766087923567,"version":"3.40.5"},"reference-count":25,"publisher":"Walter de Gruyter GmbH","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Random numbers are used in a variety of applications including simulation, sampling, and cryptography. Fortunately, there exist many well-established methods of random number generation. An example of a well-known pseudorandom number generator is the lagged-Fibonacci generator (LFG). Marsaglia\nshowed that the lagged-Fibonacci generator using addition failed some of his DIEHARD statistical tests, while it passed all when longer lags were used. This paper presents a scrambler that takes bits from a pseudorandom number generator and outputs (hopefully) improved pseudorandom numbers. The scrambler is based on a modified Feistel function, a method used in the generation of cryptographic random numbers, and multiplication by a chosen multiplier. We show that this scrambler improves the quality of pseudorandom numbers by applying it to the additive LFG with small lags. The scrambler performs well based on its performance with the TestU01 suite of randomness tests.<jats:fn id=\"j_mcma-2022-2115_fn_001\" symbol=\"1\">\n                     <jats:p>The TestU01 suite of randomness tests is more comprehensive than the DIEHARD tests. In fact, the specific suite of tests we used from TestU01 includes the DIEHARD tests<\/jats:p>\n                  <\/jats:fn>\nThe scrambling of the LFG is so successful that scrambled LFGs with small lags perform as well as unscrambled LFGs with long lags. This comes at the cost of a doubling of execution time, and provides users with generators with small memory footprints that can provide parallel generators like the LFGs in the SPRNG parallel random number generation package.<\/jats:p>","DOI":"10.1515\/mcma-2022-2115","type":"journal-article","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T19:02:40Z","timestamp":1661540560000},"page":"199-210","source":"Crossref","is-referenced-by-count":3,"title":["Scrambling additive lagged-Fibonacci generators"],"prefix":"10.1515","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5262-9183","authenticated-orcid":false,"given":"Haifa","family":"Aldossari","sequence":"first","affiliation":[{"name":"Department of Computer Science , Florida State University , Tallahassee , FL 32306-4530 , USA ; and Faculty of College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Saudi Arabia, Riyadh, PO Box 84428"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3058-4580","authenticated-orcid":false,"given":"Michael","family":"Mascagni","sequence":"additional","affiliation":[{"name":"Department of Computer Science , Florida State University , Tallahassee , FL 32306-4530 , USA ; and National Institute of Standards & Technology, ITL, Gaithersburg, MD 20899-8910, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"2023040101330858947_j_mcma-2022-2115_ref_001","doi-asserted-by":"crossref","unstructured":"A.  Aljahdali and M.  Mascagni,\nFeistel-inspired scrambling improves the quality of linear congruential generators,\nMonte Carlo Methods Appl. 23 (2017), no. 2, 89\u201399.","DOI":"10.1515\/mcma-2017-0105"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_002","doi-asserted-by":"crossref","unstructured":"L. E.  Bassham, III, A. L.  Rukhin, J.  Soto, J. R.  Nechvatal, M. E.  Smid, E. B.  Barker, S. D.  Leigh, M.  Levenson, M.  Vangel, D. L.  Banks,\nSp 800-22 rev. 1a. a statistical test suite for random and pseudorandom number generators for cryptographic applications, 2010.","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_003","doi-asserted-by":"crossref","unstructured":"C.  Bays and S.  Durham,\nImproving a poor random number generator,\nACM Trans. Math. Software 2 (1976), no. 1, 59\u201364.","DOI":"10.1145\/355666.355670"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_004","doi-asserted-by":"crossref","unstructured":"D.  Blackman and S.  Vigna,\nScrambled linear pseudorandom number generators,\nACM Trans. Math. Software 47 (2021), no. 4, Article ID 36.","DOI":"10.1145\/3460772"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_005","unstructured":"U.  Blumenthal and S. M.  Bellovin,\nA better key schedule for des-like ciphers, 1996."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_006","doi-asserted-by":"crossref","unstructured":"J.  Katz and Y.  Lindell,\nIntroduction to Modern Cryptography,\nChapman and Hall\/CRC, Boca Raton, 2014.","DOI":"10.1201\/b17668"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_007","unstructured":"D. E.  Knuth,\nArt of Computer Programming. Volume 2: Seminumerical Algorithms,\nAddison-Wesley, Reading, 2014."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_008","doi-asserted-by":"crossref","unstructured":"P.  L\u2019Ecuyer,\nRandom numbers for simulation,\nCommun. ACM 33 (1990), no. 10, 85\u201397.","DOI":"10.1145\/84537.84555"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_009","doi-asserted-by":"crossref","unstructured":"P.  L\u2019Ecuyer,\nRandom number generation,\nHandbook of Computational Statistics,\nSpringer Handb. Comput. Stat.,\nSpringer, Heidelberg (2012), 35\u201371.","DOI":"10.1007\/978-3-642-21551-3_3"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_010","doi-asserted-by":"crossref","unstructured":"P.  L\u2019Ecuyer and R.  Simard,\nTestu01: Ac library for empirical testing of random number generators,\nACM Trans. Math. Software 33 (2007), no. 4, Article ID 22.","DOI":"10.1145\/1268776.1268777"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_011","doi-asserted-by":"crossref","unstructured":"M. D.  MacLaren and G.  Marsaglia,\nUniform random number generators,\nJ. ACM 12 (1965), no. 1, 83\u201389.","DOI":"10.1145\/321250.321257"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_012","unstructured":"G.  Marsaglia,\nA current view of random number generators,\nComputer Science and Statistics, Sixteenth Symposium on the Interface,\nElsevier, Amsterdam (1985), 3\u201310."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_013","unstructured":"G.  Marsaglia,\nDiehard: A battery of tests of randomness,\n(1996), http:\/\/stat.\u2423fsu.\u2423edu\/geo\/diehard.\u2423html."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_014","doi-asserted-by":"crossref","unstructured":"M.  Mascagni, S. A.  Cuccaro, D. V.  Pryor and M. L.  Robinson,\nA fast, high quality, and reproducible parallel lagged-Fibonacci pseudorandom number generator,\nJ. Comput. Phys. 119 (1995), no. 2, 211\u2013219.","DOI":"10.1006\/jcph.1995.1130"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_015","doi-asserted-by":"crossref","unstructured":"M.  Mascagni and A.  Srinivasan,\nAlgorithm 806: Sprng: A scalable library for pseudorandom number generation,\nACM Trans. Math. Software 26 (2000), no. 3, 436\u2013461.","DOI":"10.1145\/358407.358427"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_016","doi-asserted-by":"crossref","unstructured":"M.  Matsumoto, I.  Wada, A.  Kuramoto and H.  Ashihara,\nCommon defects in initialization of pseudorandom number generators,\nACM Trans. Math. Software 17 (2007), no. 4, Article ID 15.","DOI":"10.1145\/1276927.1276928"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_017","unstructured":"A. J.  Menezes, S. A.  Vanstone and P. C.  Van Oorschot,\nHandbook of Applied Cryptography,\nCRC Press, Boca Raton, 1996."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_018","unstructured":"M. E.  O\u2019Neill,\nPcg: A family of simple fast space-efficient statistically good algorithms for random number generation,\nTechnical Report HMC-CS-2014-0905, Harvey Mudd College, Claremont, 2014."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_019","unstructured":"V.  Pareek,\nAn overview of cryptographically secure pseudorandom number generators and bbs,\nInt. J. Comput. Appl. (2014),0975\u20138887."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_020","unstructured":"M.  Saito and M.  Matsumoto,\nXsadd (version 1.1).(25 march 2014), 2014."},{"key":"2023040101330858947_j_mcma-2022-2115_ref_021","doi-asserted-by":"crossref","unstructured":"J. K.  Salmon, M. A.  Moraes, R. O.  Dror and D. E.  Shaw,\nParallel random numbers: As easy as 1, 2, 3,\nProceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis,\nIEEE Press, Piscataway (2011), 1\u201312.","DOI":"10.1145\/2063384.2063405"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_022","doi-asserted-by":"crossref","unstructured":"A.  Shamir,\nOn the generation of cryptographically strong pseudo-random sequences,\nInternational Colloquium on Automata, Languages, and Programming,\nLecture Notes in Comput. Sci. 115,\nSpringer, New York (1981), 544\u2013550.","DOI":"10.1007\/3-540-10843-2_43"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_023","doi-asserted-by":"crossref","unstructured":"G. L.  Steele, Jr., D.  Lea and C. H.  Flood,\nFast splittable pseudorandom number generators,\nACM SIGPLAN Notices 49 (2014), no. 10, 453\u2013472.","DOI":"10.1145\/2714064.2660195"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_024","doi-asserted-by":"crossref","unstructured":"S.  Vigna,\nAn experimental exploration of marsaglia\u2019s xorshift generators, scrambled,\nACM Trans. Math. Softw. 42 (2016), no. 4, 1\u201323.","DOI":"10.1145\/2845077"},{"key":"2023040101330858947_j_mcma-2022-2115_ref_025","unstructured":"Data Encryption Standard,\nFederal information processing standards publication 46,\nNational Bureau of Standards, US Department of Commerce, 23, 1977."}],"container-title":["Monte Carlo Methods and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2022-2115\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2022-2115\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T20:43:30Z","timestamp":1680381810000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/mcma-2022-2115\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,4]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,9,1]]},"published-print":{"date-parts":[[2022,9,1]]}},"alternative-id":["10.1515\/mcma-2022-2115"],"URL":"https:\/\/doi.org\/10.1515\/mcma-2022-2115","relation":{},"ISSN":["0929-9629","1569-3961"],"issn-type":[{"type":"print","value":"0929-9629"},{"type":"electronic","value":"1569-3961"}],"subject":[],"published":{"date-parts":[[2022,8,4]]}}}