This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Spectral Test for Nonrandomness and the DES
March 1990 (vol. 16 no. 3)
pp. 261-267

A test for detecting the nonrandomness of finite binary strings is proposed. This test, based on an evaluation of the power spectrum of a finite string, extends and quantifies a similar test proposed by J. Gait. As an empirical measure of the sensitivity of the test, it was compared with a chi-square test for uniformity of distribution, which also measures nonrandomness. This comparison was performed by applying each of these tests to binary strings produced using short-round versions of the data encryption standard (DES) in output-feedback mode. By varying the number of DES rounds from 1 to 16, it was possible to gradually vary the degree of randomness of the resulting strings. The degree of randomness of the DES, including the 15 short-round versions, was also assessed. Only ensembles generated by one and two round versions were rejected as random.

[1] J. Gait, "A new nonlinear pseudorandom number generator,"IEEE Trans. Soffware Eng., vol. SE-3, no. 5, pp. 359-363, Sept. 1977.
[2] A. V. Oppenheim and R. W. Schafer,Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
[3] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[4] A. Kolmogorov, "Three approaches to the quantitative definition of information,"Problems Inform. Transmission. vol. 1, no. 1, pp. 1- 7, Jan. 1965.
[5] G. Chaitan, "On the length of programs for computing finite binary sequences,"J. ACM, vol. 13, pp. 547-569, 1966.
[6] D. E. Knuth,The Art of Computer Programming, Vol. 2, Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1981.
[7] "Data encryption standard," Nat. Bureau Standards, Washington, DC, FIPS Publ. 46, Jan. 1977.
[8] H. Katzan,The Standard Data Encryption Algorithm. New York: Petrocelli, 1977.
[9] H. Cramer,Mathematical Methods of Statistics. Princeton, NJ: Princeton University Press, 1946.

Index Terms:
spectral test; nonrandomness; finite binary strings; power spectrum; empirical measure; chi-square test; short-round versions; data encryption standard; output-feedback mode; DES rounds; cryptography; program testing; standards; statistical analysis; word processing.
Citation:
F.A. Feldman, "A New Spectral Test for Nonrandomness and the DES," IEEE Transactions on Software Engineering, vol. 16, no. 3, pp. 261-267, March 1990, doi:10.1109/32.48934
Usage of this product signifies your acceptance of the Terms of Use.