Testing Random Number Generators by Walsh Transform

Authors:
Chung-Kwong Yuen
Affiliations:
Department of Information Science, University of Tasmania
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 5
Cited 1

Algorithm 488: A Gaussian pseudo-random number generator

Communications of the ACM
Digital Time Series Analysis

Digital Time Series Analysis
Function Approximation by Walsh Series

IEEE Transactions on Computers
Evaluation of Walsh Power Spectrum of Nearly White Signals

IEEE Transactions on Computers
Upper Bounds on Walsh Transforms

IEEE Transactions on Computers

Fast Spectral Tests for Measuring Nonrandomness and the DES

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology

Quantified Score

Hi-index	14.98

Visualization

Abstract

A truly random sequence of numbers has an asymptotically flat Walsh power spectrum. This fact is used to devise a new test for the randomness of the output of random number generators. Because it takes little computing time to obtain the Walsh power spectrum of even very long sequences, generators with large periods can be tested. Some computed examples are shown.