A Practical Approach to Testing Random Number Generators in Computer Algebra Systems

Abstract: This paper has a practical aim. For a long time, implementations of pseudorandom number generators in standard libraries of programming languages had poor quality. The situation started to improve only recently. Up to now, a large number of libraries and weakly supported mathematical packages use outdated algorithms for random number generation. Four modern sets of statistical tests that can be used for verifying random number generators are described. It is proposed to use command line utilities, which makes it possible to avoid low-level programming in such languages as C or C++. Only free open source systems are considered. © 2020, Pleiades Publishing, Ltd.

Authors
Gevorkyan M.N. 1 , Demidova A.V. 1 , Korol’kova A.V. 1 , Kulyabov D.S. 1, 2
Journal
Computational Mathematics and Mathematical Physics
Number of issue
1
Language
English
Pages
65-73
Status
Published
Link
External link
DOI
10.1134/S096554252001008X
Volume
60
Year
2020
Organizations
  • 1 Department of Applied Probability and Informatics, Peoples’ Friendship University of Russia (RUDN University), Moscow, 117198, Russian Federation
  • 2 Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Moscow oblast 141980, Russian Federation
Keywords
DieHarder; gjrand; PractRand; random number generation; TestU01
Date of creation
02.11.2020
Date of change
01.03.2021
Short link
https://repository.rudn.ru/en/records/article/record/65277/
Share

Other records