Abstract
Two spectral tests for detecting nonrandomness were proposed in 1977. One test, developed by J. Gait [1], considered properties of power spectra obtained from the discrete Fourier transform of finite binary strings. Gait tested the DES [10], [11] in output-feedback mode, as a pseudorandom generator. Unfortunately, Gait’s test was not properly developed [3] ,[4], nor was his design for testing the DES adequate.
Another test, developed by C. Yuen [2], considered analogous properties for the Walsh transform. In estimating the variance of spectral bands, Yuen assumed the spectral components to be independent. Except for the special case of Gaussian random numbers, this assumption introduces a significant error into his estimate.
We recently [3] ,[4] constructed a new test for detecting nonrandomness in finite binary strings, which extends and quantifies Gait’s test. Our test is based on an evaluation of a statistic, which is a function of Fourier periodograms [5]. Binary strings produced using short-round versions of the DES in output-feedback mode were tested. By varying the number of DES rounds from 1 to 16, it was thought possible to gradually vary the degree of randomness of the resulting strings. However, we found that each of the short-round versions, consisting of 1, 2, 3, 5 and 7 rounds, generated ensembles for which at least 10% of the test strings were rejected as random, at a confidence level approaching certainty.
A new test, based on an evaluation of the Walsh spectrum, is presented here. This test extends the earlier test of C. Yuen. Testing of the DES, including short-round versions, has produced results consistent with those previously obtained in [3].
We prove that our measure of the Walsh spectrum is equivalent to a measure of the skirts of the logical autocorrelation function. It is clear that an analogous relationship exists between Fourier periodograms and the circular autocorrelation function.
Chapter PDF
References
J. Gait, “A New Nonlinear Pseudorandom Number Generator,” IEEE Trans. on Software Eng., Vol. SE-3(5) pp. 359–363 (Sept. 1977)
C. Yuen, “Testing Random Number Generators by Walsh Transform,” IEEE Trans. on Computers, Vol. C-26(4) pp. 329–333 (April 1977)
F. A. Feldman, “A New Spectral Test for Nonrandomness and the DES,” submitted to IEEE Trans. on Software Engineering (July 1986)
F. A. Feldman, “A New Spectral Measure of Nonrandomness,” Suffolk University Technichal Report No. 5, (1987)
A. V. Oppenheim and R. W. Schafer, Digital Signal Processing. Prentice-Hall, Inc., Englewood Cliffs. New Jersey, 1975.
A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishiing Company, Reading, Mass. 1974.
A. Kolmogorov, “Three Approaches to the Quantitative Definition of Information,” PROB. INFO. TRANSMISSION, Vol. 1, No. 1, Jan. 1965, 1–7.
G. Chaitan, “On the Length of Programs for Computing Finite Binary Sequences,” JACM (13), 1966, 547–569
D. Knuth, The Art of Computer Programming; Vol. 2, Seminumerical Algorithms, Addison-Wesley, Reading, Mass. 1969.
“Data Encryption Standard,” FIPS PUB 46, National Bureau of Standards, Washington, D.C., Jan. 1977.
H. Katzan, The Standard Data Encryption Algorithm, Petrocelli Books, Inc., New York, 1977.
K. G. Beauchamp, Applications of Walsh and Related Functions, Academic Press, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Feldman, F.A. (1988). Fast Spectral Tests for Measuring Nonrandomness and the DES. In: Pomerance, C. (eds) Advances in Cryptology — CRYPTO ’87. CRYPTO 1987. Lecture Notes in Computer Science, vol 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48184-2_22
Download citation
DOI: https://doi.org/10.1007/3-540-48184-2_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18796-7
Online ISBN: 978-3-540-48184-3
eBook Packages: Springer Book Archive