scholarly journals Deviation Test: Comparison of Degree of Randomness of the Tables of Random Numbers due to Tippet, Fisher & Yates, Kendall & Smith and Rand Corporation

2017 ◽  
Vol 2 (3) ◽  
pp. 1-5
Author(s):  
Dhritikesh Chakrabarty
Author(s):  
Pramit Pandit ◽  
Bishvajit Bakshi

In the field of statistics as well as in the different branches of experimental sciences, random number tables have been playing a vital role for the purpose of selecting random samples. Among the existing different random number tables, four tables namely, Tippet’s random number table, Fisher and Yates random number table, Kendall and Smith's random number table and random number table of RAND Corporation are of most frequent use. The current study aims at attempting to make a comparative review on the degree on randomness of these four most frequently used random number tables based on  test, run test and deviation test. From the findings based on  test, the highest degree of randomness has been observed in random number table due to RAND Corporation followed by due to Kendall and Smith, Tippet, Fisher and Yates, respectively. In case of run test, the highest degree of randomness has been noticed in random number table due to Fisher and Yates followed by due to Tippet, RAND Corporation, Kendall and Smith, respectively. However, from the findings based on the deviation test, the highest degree of randomness has been observed in random number table due to Kendall and Smith followed by due to Fisher and Yates, RAND Corporation, Tippet, respectively. It can observed that the findings obtained in the studies based on different tests are not alike. Consequently, there is necessity to search for the reasons of the difference between these findings. Moreover, it can also be concluded that attempts should be made by the researchers to construct new random numbers table with enhanced degree of randomness than that of the existing tables.


2011 ◽  
Vol 43 (8) ◽  
pp. 76-80
Author(s):  
Rostislav M. Mikhersky ◽  
Oleg I. Popov
Keyword(s):  

Micromachines ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 31
Author(s):  
Junxiu Liu ◽  
Zhewei Liang ◽  
Yuling Luo ◽  
Lvchen Cao ◽  
Shunsheng Zhang ◽  
...  

Recent research showed that the chaotic maps are considered as alternative methods for generating pseudo-random numbers, and various approaches have been proposed for the corresponding hardware implementations. In this work, an efficient hardware pseudo-random number generator (PRNG) is proposed, where the one-dimensional logistic map is optimised by using the perturbation operation which effectively reduces the degradation of digital chaos. By employing stochastic computing, a hardware PRNG is designed with relatively low hardware utilisation. The proposed hardware PRNG is implemented by using a Field Programmable Gate Array device. Results show that the chaotic map achieves good security performance by using the perturbation operations and the generated pseudo-random numbers pass the TestU01 test and the NIST SP 800-22 test. Most importantly, it also saves 89% of hardware resources compared to conventional approaches.


1984 ◽  
Vol 6 (4) ◽  
pp. 5-6 ◽  
Author(s):  
Daniel Guinier

2021 ◽  
Vol 1865 (2) ◽  
pp. 022018
Author(s):  
Menglin Zhu ◽  
Xiangyu Wang ◽  
Bingjie Xu ◽  
Song Yu ◽  
Ziyang Chen ◽  
...  

Electronics ◽  
2021 ◽  
Vol 10 (13) ◽  
pp. 1517
Author(s):  
Xinsheng Wang ◽  
Xiyue Wang

True random number generators (TRNGs) have been a research hotspot due to secure encryption algorithm requirements. Therefore, such circuits are necessary building blocks in state-of-the-art security controllers. In this paper, a TRNG based on random telegraph noise (RTN) with a controllable rate is proposed. A novel method of noise array circuits is presented, which consists of digital decoder circuits and RTN noise circuits. The frequency of generating random numbers is controlled by the speed of selecting different gating signals. The results of simulation show that the array circuits consist of 64 noise source circuits that can generate random numbers by a frequency from 1 kHz to 16 kHz.


2021 ◽  
Vol 54 (6) ◽  
pp. 1-38
Author(s):  
Peter Kietzmann ◽  
Thomas C. Schmidt ◽  
Matthias Wählisch

Random numbers are an essential input to many functions on the Internet of Things (IoT). Common use cases of randomness range from low-level packet transmission to advanced algorithms of artificial intelligence as well as security and trust, which heavily rely on unpredictable random sources. In the constrained IoT, though, unpredictable random sources are a challenging desire due to limited resources, deterministic real-time operations, and frequent lack of a user interface. In this article, we revisit the generation of randomness from the perspective of an IoT operating system (OS) that needs to support general purpose or crypto-secure random numbers. We analyze the potential attack surface, derive common requirements, and discuss the potentials and shortcomings of current IoT OSs. A systematic evaluation of current IoT hardware components and popular software generators based on well-established test suits and on experiments for measuring performance give rise to a set of clear recommendations on how to build such a random subsystem and which generators to use.


2020 ◽  
Vol 26 (3) ◽  
pp. 193-203
Author(s):  
Shady Ahmed Nagy ◽  
Mohamed A. El-Beltagy ◽  
Mohamed Wafa

AbstractMonte Carlo (MC) simulation depends on pseudo-random numbers. The generation of these numbers is examined in connection with the Brownian motion. We present the low discrepancy sequence known as Halton sequence that generates different stochastic samples in an equally distributed form. This will increase the convergence and accuracy using the generated different samples in the Multilevel Monte Carlo method (MLMC). We compare algorithms by using a pseudo-random generator and a random generator depending on a Halton sequence. The computational cost for different stochastic differential equations increases in a standard MC technique. It will be highly reduced using a Halton sequence, especially in multiplicative stochastic differential equations.


Sign in / Sign up

Export Citation Format

Share Document