An Effective Statistical Test Suite for Pseudorandom number Generators in Digital Signatures and Security Robustness Evaluation including a Wavelet Test for Randomness

Author(s):  
Dimitrios A. Karras
Author(s):  
Andrew Rukhin ◽  
Juan Sota ◽  
James Nechvatal ◽  
Miles Smid ◽  
Elaine Barker ◽  
...  

2014 ◽  
Vol 61 (1) ◽  
pp. 105-116
Author(s):  
Viliam Hromada ◽  
Milan Vojvoda

Abstract This paper deals with a new pseudorandom number generator MSTg proposed in 2010. Its construction is based on random covers for finite groups. We have used a public-key cryptosystem Poly-Dragon to generate these random covers and have studied the statistical properties of the resulting pseudorandom number generator by testing its output using the NIST Statistical Test Suite


ACTA IMEKO ◽  
2020 ◽  
Vol 9 (4) ◽  
pp. 128
Author(s):  
Daniel Chicayban Bastos ◽  
Luis Antonio Brasil Kowada ◽  
Raphael C. S. Machado

<p class="Abstract">Statistical sampling and simulations produced by algorithms require fast random number generators; however, true random number generators are often too slow for the purpose, so pseudorandom number generators are usually more suitable. But choosing and using a pseudorandom number generator is no simple task; most pseudorandom number generators fail statistical tests. Default pseudorandom number generators offered by programming languages usually do not offer sufficient statistical properties. Testing random number generators so as to choose one for a project is essential to know its limitations and decide whether the choice fits the project’s objectives. However, this study presents a reproducible experiment that demonstrates that, despite all the contributions it made when it was first published, the popular NIST SP 800-22 statistical test suite as implemented in the software package is inadequate for testing generators.</p>


2020 ◽  
Vol 60 (11) ◽  
pp. 1747-1753
Author(s):  
A. A. Belov ◽  
N. N. Kalitkin ◽  
M. A. Tintul

2001 ◽  
Vol 08 (02) ◽  
pp. 137-146 ◽  
Author(s):  
Janusz Szczepański ◽  
Zbigniew Kotulski

Pseudorandom number generators are used in many areas of contemporary technology such as modern communication systems and engineering applications. In recent years a new approach to secure transmission of information based on the application of the theory of chaotic dynamical systems has been developed. In this paper we present a method of generating pseudorandom numbers applying discrete chaotic dynamical systems. The idea of construction of chaotic pseudorandom number generators (CPRNG) intrinsically exploits the property of extreme sensitivity of trajectories to small changes of initial conditions, since the generated bits are associated with trajectories in an appropriate way. To ensure good statistical properties of the CPRBG (which determine its quality) we assume that the dynamical systems used are also ergodic or preferably mixing. Finally, since chaotic systems often appear in realistic physical situations, we suggest a physical model of CPRNG.


Sign in / Sign up

Export Citation Format

Share Document