The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
An Experimental Exploration of Marsaglia's xorshift Generators, Scrambled
Open accessAbstract
Marsaglia proposed xorshift generators are a class of very fast, good-quality pseudorandom number generators. Subsequent analysis by Panneton and L'Ecuyer has lowered the expectations raised by Marsaglia's article, showing several weaknesses of such generators. Nonetheless, many of the weaknesses of xorshift generators fade away if their result is scrambled by a nonlinear operation (as originally suggested by Marsaglia). In this article we explore the space of possible generators obtained by multiplying the result of a xorshift generator by a suitable constant. We sample generators at 100 points of their state space and obtain detailed statistics that lead us to choices of parameters that improve on the current ones. We then explore for the first time the space of high-dimensional xorshift generators, following another suggestion in Marsaglia's article, finding choices of parameters providing periods of length 2 1024 − 1 and 2 4096 − 1. The resulting generators are of extremely high quality, faster than current similar alternatives, and generate long-period sequences passing strong statistical tests using only eight logical operations, one addition, and one multiplication by a constant.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Numerical Recipes, The Art of Scientific Computing
Press, W. H., Flannery, B. P., Teukolsky, S. A., Vetterling, W. T., & Gould, H. (1987) · American Journal of Physics · doi:10.1119/1.14981 · Cited by 10,024
A NEW MEASURE OF RANK CORRELATION
KENDALL, M. G. (1938) · Biometrika · doi:10.1093/biomet/30.1-2.81 · Cited by 7,269 · cited 1×
“The scatter plot in Figure 5 and Kendall’s(5) τ ≈ 0.98 between the two rankings we obtain make rather clear that this is not the case. In particular, the four best conjugate pairs in Table I are the same with both seeds. To gather more information, we ran the full BigCrush suite and Dieharder on our four best generato…”
InfluentialMersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780 · cited 1×
“2 1). 9. COMPARISON How do our best xorshift* generators score with respect to more complex generators in the literature? We decided to perform a comparison with the popular Mersenne Twister MT19937 [Matsumoto and Nishimura 1998],13 with WELL1024a/WELL19937a, two generators introduced by Panneton et al. [2006] as an i…”
ResultBassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 1×
“Indeed, other, more sophisticated methods might be used to aggreate the result of our samples: combining p-values, for instance, or computing a p-value of p-values [Rukhin et al. 2001].”
MethodRandom Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
THE TREATMENT OF TIES IN RANKING PROBLEMS
KENDALL, M. G. (1945) · Biometrika · doi:10.1093/biomet/33.3.239 · Cited by 809 · cited 1×
“The first and most important is TestU01, a test suite developed by L’Ecuyer and Simard [2007] that contains several tests oriented towards the generation of uniform real numbers in [0 .”
Background
Research works printed but not linked: 3
- Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. 1994. Concrete Mathematics (2nd ed.). Addison--Wesley.
- Robert H. Lewis. 2013. Fermat: A Computer Algebra System for Polynomial and Matrix Computation (Version 5.1). (2013). Retrieved January 8, 2014 from http://home.bway.net/lewis/.
- 10.5555/130653 · doi:10.5555/130653
Cited by
The Belle II Core Software: Belle II Framework Software Group
Kuhr, T., Pulvermacher, C., Ritter, M., Hauth, T., & Braun, N. (2019) · Computing and Software for Big Science · doi:10.1007/s41781-018-0017-9 · Cited by 204
“For Belle II, we chose xorshift1024* [28], a newer generation PRNG based on the Xorshift algorithm proposed by Marsaglia [29].”
MethodScrambled Linear Pseudorandom Number Generators
Blackman, D., & Vigna, S. (2021) · ACM Transactions on Mathematical Software · doi:10.1145/3460772 · Cited by 177
“, see Theorem 14 of [7], which can be used to prove (3) for xorshift linear engines with multiple-word state [39]).”
InfluentialSelf-citationA search for good pseudo-random number generators: Survey and empirical studies
Bhattacharjee, K., & Das, S. K. (2022) · Computer Science Review · doi:10.1016/j.cosrev.2022.100471 · Cited by 173
“Whereas, in [17], to remove the flaws of xorshift generators, a non-linear operation is applied to scramble the results.”
BackgroundMethodFIREbox: simulating galaxies at high dynamic range in a cosmological volume
Feldmann, R., Quataert, E., Faucher‐Giguère, C., Hopkins, P. F., Çatmabacak, O., Kereš, D., Bassini, L., Bernardini, M., Bullock, J. S., Cenci, E., et al. (2023) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stad1205 · Cited by 182
A Guideline on Pseudorandom Number Generation (PRNG) in the IoT
Kietzmann, P., Schmidt, T. C., & Wählisch, M. (2021) · ACM Computing Surveys · doi:10.1145/3453159 · Cited by 128
“owing. Marsaglia [82] proposed a collection of extended Xorshift PRNGs with an increased period length and improved statistical properties. Vigna et al. analyzed and improved these generators further [83]–[85]. We briefly discuss results about the Xorshift64* and the Xoroshiro128+ derivatives at the side, which we inte…”
BackgroundFurther scramblings of Marsaglia’s xorshift generators
Vigna, S. (2016) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2016.11.006 · Cited by 80
Self-citationHistory of uniform random number generation
L’Ecuyer, P. (2017) · Winter Simulation Conference · doi:10.1109/wsc.2017.8247790 · Cited by 86
“Vigna (2016) proposed to multiply the state of the xorshift generator by a large integer a, modulo m = 264, to produce the output.”
BackgroundQuality of randomness and node dropout regularization for fitting neural networks
Koivu, A., Kakko, J., Mäntyniemi, S., & Sairanen, M. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.117938 · Cited by 39
Bakiri, M., Couchot, J.-F., & Guyeux, C. (2017) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2017.2754650 · Cited by 26
“We can also cite the XOR64∗ generators [32],”
BackgroundELKI: A large open-source library for data analysis - ELKI Release 0.7.5 "Heidelberg"Preprint
Schubert, E., & Zimek, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.03616 · Cited by 69
Random number generators for large-scale parallel Monte Carlo simulations on FPGA
Lin, Y., Wang, F., & Liu, B. (2018) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.01.029 · Cited by 24
Demonstrating GPU code portability and scalability for radiative heat transfer computations
Peterson, B., Humphrey, A., Holmen, J. K., Harman, T., Berzins, M., Sunderland, D., & Edwards, H. (2018) · Journal of Computational Science · doi:10.1016/j.jocs.2018.06.005 · Cited by 18
Xorshift1024*, xorshift1024+, xorshift128+ and xoroshiro128+ fail statistical tests for linearity
Daniel Lemire, A., & O'NEILL, M. E. (2018) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2018.10.019 · Cited by 15
“1a): he states that it passes Big Crush, even after reversing the bit order [4].”
BackgroundMukherjee, S., Adak, S., Bhattacharjee, K., & Das, S. K. (2021) · International Journal of Modern Physics C · doi:10.1142/s0129183121500911 · Cited by 14
New pseudo-random number generator based on improved discrete-space chaotic map
Lambić, D., & Nikolić, M. (2019) · Filomat · doi:10.2298/fil1908257l · Cited by 12
“In some cases TestU01 is more sensitive to flaws in the most-significant bits so it is recommended to repeat testing with reversed bits [24].”
BackgroundMultiple Streams with Recurrence-Based, Counter-Based, and Splittable Random Number Generators
L’Ecuyer, P., Nadeau-Chamard, O., Chen, Y., & Lebar, J. (2021) · Winter Simulation Conference · doi:10.1109/wsc52266.2021.9715397 · Cited by 12
“As a concrete illustration, the TPUs at Google implement the xorshift128+ generator of Vigna (2016) directly in hardware.”
MethodThe Catena Password-Scrambling Framework
Forler, C., Lucks, S., & Wenzel, J. (2015) · Cited by 10
Random number generation using decimal cellular automata
Bhattacharjee, K., & Das, S. K. (2019) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2019.104878 · Cited by 10
An OpenCL library for parallel random number generators
Ciglarič, T., Češnovar, R., & Štrumbelj, E. (2019) · The Journal of Supercomputing · doi:10.1007/s11227-019-02756-2 · Cited by 9
It is high time we let go of the Mersenne TwisterPreprint
Vigna, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.06437 · Cited by 19
“The author has also tried to find an empirical correlation between good equidistribution score in [35], by testing extensively the 2200 possible parameterizations of Marsaglia’s xorshift generators and comparing the results of statistical testing with equidistribution score: once one restricts to reasonably good gener…”
Self-citationRaw QPP-RNG randomness via system jitter across platforms: a NIST SP 800-90B evaluation
Vrana, G., Lou, D., & Kuang, R. (2025) · Scientific Reports · doi:10.1038/s41598-025-13135-8 · Cited by 8
“21 • PRNGs: Independent tests with XORSHIFT128+ and NEXT_X48 22 .”
InfluentialSUL32C: secure ultra-lightweight 32-bit cipher for IoT devices
Witwit, A. J. H., Fanfakh, A. B. M., & Idrees, A. K. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07448-8 · Cited by 5
Quantum permutation pad for quantum secure symmetric and asymmetric cryptography
Kuang, R. (2025) · Academia Quantum · doi:10.20935/acadquant7457 · Cited by 4
Scrambling additive lagged-Fibonacci generators
Aldossari, H., & Mascagni, M. (2022) · Monte Carlo Methods and Applications · doi:10.1515/mcma-2022-2115 · Cited by 4
Stauffer, M., Hanne, T., & Dornberger, R. (2016) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2016.7743789 · Cited by 4
“The 30 test cases are divided into five groups [1-6, 7-12, 13-18, 19-24, 25-30] with different rack capacity.”
BackgroundRandom Number Generators in Training of Contextual Neural Networks
Huk, M., Shin, K., Kuboyama, T., & Hashimoto, T. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-73280-6_57 · Cited by 6
Generating Uniform Random Numbers
Kneusel, R. T. (2018) · Springer eBooks · doi:10.1007/978-3-319-77697-2_2 · Cited by 4
Bakiri, M., Couchot, J.-F., & Guyeux, C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.08410 · Cited by 4
“XORshift∗ generators [Vigna, 2014a], XORshift64 [Marsaglia et al.”
BackgroundA Fast Hardware Pseudorandom Number Generator Based on xoroshiro128
Hanlon, J., & Felix, S. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2022.3204226 · Cited by 5
“Gjrand is another library of PRNGs and statistical tests, created by David Blackman, a co-creator of the xoroshiro128 family of generators.”
MethodInfluentialMulti-Layer and Clustering-Based Security Implementation for an IoT Environment
Gupta, D. N., & Kumar, R. (2021) · International Journal of System Dynamics Applications · doi:10.4018/ijsda.20220701.oa3 · Cited by 3
“Sebastiano Vigna, in 2016, performed some experimental exploration on Marsaglia’s XOR-shift generator and proposed XOR-shift* RNG (Vigna, 2016).”
MethodCoupled Anharmonic Thermochemistry from Stratified Monte Carlo Integration
Rath, G., Kopp, W. A., & Leonhard, K. O. (2021) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.1c00668 · Cited by 3
A General Approach to Fuzzy Community Detection in Social Networks
Niño, A., Reyes, S. C., Martín-Baos, J. Á., & Muñoz‐Caro, C. (2019) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.2019.8846958 · Cited by 3
“As a good and efficient general random number generator for creation of BA networks, we implement the XORShift64* Marsaglia generator [34].”
MethodQPP-RNG: A conceptual quantum system for true randomness
Kuang, R. (2025) · Physical review. E · doi:10.1103/d937-5yt7 · Cited by 4
A novel partition strategy for efficient implementation of 3D Cellular Genetic Algorithms
Letras, M., Morales-Reyes, A., Cumplido, R., Martínez-Peñaloza, M.-G., & Feregrino-Uribe, C. (2023) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2023.104986 · Cited by 2
Measuring randomness in IoT products
Bastos, D. C., Kowada, L. A. B., & Machado, R. C. S. (2019) · IEEE International Workshop on Metrology for Industry 4.0 & IoT (MetroInd4.0&IoT) · doi:10.1109/metroi4.2019.8792883 · Cited by 2
Kuang, R. (2026) · Physical review. E · doi:10.1103/24hx-9y3l · Cited by 2
A Complete Bibliography of ACM Transactions on Modeling and Computer Simulation
Beebe, N. H. F. (2015) · Cited by 1
Kuhr, T., Ritter, M., & Belle II Software Group (2016) · Journal of Physics Conference Series · doi:10.1088/1742-6596/762/1/012007
Ensuring Reproducible Simulations on Heterogeneous Computing Environments for Social Simulation
Harada, T., & Murata, T. (2018) · Transactions of the Institute of Systems Control and Information Engineers · doi:10.5687/iscie.31.37
“XorShift* [35] 2(128)−1 16 2(1024)−1 132”
Evolução de modelos diferenciais para sistemas concretos por Programação Genética
Peretta, I. (2015) · doi:10.14393/ufu.te.2015.123
“h, a class to produce pseudo random number generators, based on xorshift*64 and xorshift*1024 [83].”
Muñoz‐Caro, C., Niño, A., & Reyes, S. C. (2019) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.5537
Cellular Automata: Reversibility, Semi-reversibility and RandomnessPreprint
Bhattacharjee, K. (2019) · arXiv (Cornell University) · doi:10.13140/rg.2.2.35585.61283 · Cited by 9
Portable and Performant GPU/Heterogeneous Asynchronous Many-Task Runtime System
Peterson, B. S. (2020)
Real-Time Optimization of a Pseudo-Random Number Generator Using Particle Swarm Optimization Method
Muhammed Saadetdin, K. A. Y. A., & İNCE, K. (2022) · Computer Science · doi:10.53070/bbd.1173694
Moments of Gaussian Distributions for Small and Large Sample Sizes Revisited
Heiser, F., & Knapp, E. (2024) · Mathematics and Statistics · doi:10.13189/ms.2024.120111
Implementation of Lightweight PRNG on PLC for Industrial Control Systems
Sama, A., Gaol, F. L., Supangkat, S. H., & Ranti, B. (2023) · International Conference on Intelligent Cybernetics Technology & Applications (ICICyTA) · doi:10.1109/icicyta60173.2023.10429019
“…in PLC in this paper, XORasm, is based on the known fast and lightweight XORshift algorithm, as described in the original paper [16], and further explored in [17], [18], providing lightweight PRNG implementation while also delivering better random number generators than the current implementation.”
MethodLightweight Pseudo Random Number Generator for Embedded Systems
Sama, A., Meyliana, Heryadi, Y., & Sahroni, . R. (2024) · International Journal of Safety and Security Engineering · doi:10.18280/ijsse.140409
“Stronger PRNG is possible (64 bits and above) for PC or PC Servers based on the XORshift algorithm (fast and lightweight) [26] and further explored in previous studies [27, 28].”
Linear Balanced Boolean Sequence and Comparative Analysis of Random Number Generators
Pandey, S. K. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00115
“• Enumeration result for linear balanced Boolean functions. n 2 is one of the commonly available steps in the generation of binary sequence [12], [13].”
CoolTest: Improved Randomness Testing Using Boolean Functions
Gavenda, J., & Sýs, M. (2025) · IFIP advances in information and communication technology · doi:10.1007/978-3-031-92886-4_1 · Cited by 1
Image Encryption Based on S-Box and Xorshift PRNG
Aboytes-González, J. A., Gallegos-García, G., & Ramírez-Torres, M. T. (2025) · International Conference on Electrical and Computer Engineering Researches (ICECER) · doi:10.1109/icecer65523.2025.11401371
“Subsequent analysis described in [3], [5] emphasized that the selection of shift parameters a and b has a direct effect on the system entropy and on the irreducibility of the recurrence polynomial, ultimately determining the achievable period length, ideally approaching 2 n − 1 .”
A Transparent, Simple, Audit-Oriented Python-Based Binary Allocation Prototype for Clinical Research
Malone, K. T. (2026) · Cureus · doi:10.7759/cureus.108209
“In xorshift* analysis, that bit is a known weak point for scrambling [17].”
InfluentialPerformance Analysis of Xorshift & Mersenne Twister PRNGs with Java and Python
Durrani, O. K., Ahmed, S., Rabbani, S. R., Gowda, T. P., Akram, F., & Gadad, A. T. (2026) · International Conference on Smart Futuristic Technology (SMARTTECH) · doi:10.1109/icsft66733.2026.11507051
CoolTest: Randomness test suited for small data volumes
Gavenda, J., & Sýs, M. (2026) · Computers & Security · doi:10.1016/j.cose.2026.104986
Gulić, M., Turkalj, P., Valčić, M., & Grubišić, N. (2026) · International Convention on Information and Communication Technology, Electronics and Microelectronics · doi:10.1109/mipro70003.2026.11591948
Metadata
- Authors
- Vigna, S.
- Affiliations
- University of Milan (IT)
- Corresponding author
- Vigna, Sebastiano
- ORCID
- Vigna, Sebastiano
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2016-06-14
- Volume
- 42
- Issue
- 4
- Pages
- 1-23
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W1768180846
- Cited by
- 55
- References
- 25
- Citations by year
- 2026: 5 · 2025: 7 · 2024: 2 · 2023: 3 · 2022: 5 · 2021: 8 · 2020: 1 · 2019: 9 · 2018: 6 · 2017: 2 · 2016: 4
- FWCI
- 7.47
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- ACM Transactions on Mathematical Software (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- EU-FET (NADINE (GA 288956))
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Mathematical Approximation and Integration
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Numerical Methods and Algorithms
- Physical Sciences › Mathematics › Modeling and Simulation › Mathematical and Computational Methods
- Keywords
- pseudorandom number generators, scrambling, long period, randomness testing, linear feedback shift registers
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.