Abstract
A number of statistical tests have been recommended over the last twenty years for assessing the randomness of long binary strings used in cryptographic algorithms. Several of these tests include methods of examining subblock patterns. These tests are the uniformity test, the universal test and the repetition test. The effectiveness of these tests are compared based on the subblock length, the limitations on data requirements, and on their power in detecting deviations from randomness. Due to the complexity of the test statistics, the power functions are estimated by simulation methods. The results show that for small subblocks the uniformity test is more powerful than the universal test, and that there is some doubt about the parameters of the hypothesised distribution for the universal test statistic. For larger subblocks the results show that the repetition test is the most effective test, since it requires far less data than either of the other two tests and is an efficient test in detecting deviations from randomness in binary strings.
Similar content being viewed by others
References
Beker, H. and Piper, F. (1982) Cipher Systems: The Protection of Communications, Wiley.
Bhattacharyya, G. and Johnson, R. (1977) Statistical Concepts and Methods, Wiley.
Feller, W. (1968) An Introduction to Probability Theory and Its Applications, 1, 2nd edition, Wiley.
Gustafson, H. M., Dawson, E. P. and Golić, J. Dj. (1997) Automated statistical methods for measuring the strength of block ciphers. Statistics and Computing, 7, 125–135.
Knuth, D. (1973a) The Art of Computer Programming: Seminumerical Algorithms, 2, Addison-Wesley.
Knuth, D. (1973b) The Art of Computer Programming: Sorting and Searching, 3, Addison-Wesley.
Kolchin, V. F. (1966) The speed of convergence to limit distributions in the classical ball problem. Theory of Probability and its Applications, 11, 128–140.
L'Ecuyer, P. (1988) Effcient and portable combined random number generators. Communications of the ACM, 31, No. 6, 742–774.
Maurer, U. M. (1992) A universal statistical test for random bit generators. Journal of Cryptology, 5, 89–105.
Sun Microsystems (1994) SPARCworks-Pro-C++, Version: 4.0.1.
Rights and permissions
About this article
Cite this article
Gustafson, H.M., Dawson, E.P., Golić, J.D. et al. Methods for testing subblock patterns. Statistics and Computing 9, 279–286 (1999). https://doi.org/10.1023/A:1008959905863
Issue Date:
DOI: https://doi.org/10.1023/A:1008959905863