zbMATH — the first resource for mathematics

Randomness measures related to subset occurrence. (English) Zbl 1421.94056
Dawson, Ed (ed.) et al., Cryptography: policy and algorithms. International conference, Brisbane, Queensland, Australia, July 3–5, 1995. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1029, 132-143 (1996).
Summary: Statistical tests have been applied to measures obtained from partitioning the keystream of a stream cipher into subsets of a given length. Similarly, the strength of a block cipher has been measured by applying statistical tests to subsets obtained from both the input and output blocks. There are problems in applying these tests as the size of the subsets increases. We propose a novel method based on the classical occupancy problem to deal with larger subsets in testing for randomness in a keystream in the case of a stream cipher and for independence between subsets of input and output blocks in the case of a block cipher.
For the entire collection see [Zbl 1422.94002].
94A60 Cryptography
Full Text: DOI
[1] H. Beker and F. Piper Cipher Systems: The Protection of Communications, Wiley, 1982.
[2] W. Caelli, E. Dawson, H. Gustafson and L. Nielsen CRYPT-X Package, Office of Commercial Services, Queensland University of Technology, Australia, 1992. ISBN 0 86856 8090.
[3] J. Carroll and L. Robins, Computer Cryptanalysis, Technical Report No. 223, 1988, Deptartment of Computer Science, The University of Western Ontario, London, Ontario.
[4] W. Feller, An Introduction to Probability Theory and Its Applications, 1, 2nd edition, Wiley, 1968. · Zbl 0155.23101
[5] L. J. Folks, Combination of Independent Tests, Handbook of Statistics, 4, Elsevier, 1984, 113-121.
[6] J. Dj. Golić, On the Security of Shift Register Based Keystream Generators, Fast Software Encryption ’93, Lecture Notes in Computer Science, 803, R. J. Anderson ed., Springer-Verlag, 1994, 90-100. · Zbl 0943.94532
[7] N. L. Johnson and S. Kotz, Urn Models and Their Application, Wiley, 1977. · Zbl 0352.60001
[8] D. Knuth, The Art of Computer Programming: Seminumerical Algorithms, 2, Addison Wesley, 1973. · Zbl 0895.65001
[9] D. Knuth, The Art of Computer Programming: Sorting and Searching, 3, Addison Wesley, 1973. · Zbl 0302.68010
[10] V. F. Kolchin, The Speed of Convergence to Limit Distributions in the Classical Ball Problem, Theory of Probability and its Applications, 11, 1966, 128-140. · Zbl 0221.60009
[11] A. G. Konheim, Cryptography — A Primer, Wiley, New York, 1981.
[12] A. Lempel and J. Ziv, On the Complexity of Finite Sequences, IEEE Transactions on Information Theory, IT-22, 1976, 75-81. · Zbl 0337.94013
[13] J. L. Massey, Shift Register Synthesis and BCH Decoding, IEEE Transactions on Information Theory, IT-15, 1969, 122-127. · Zbl 0167.18101
[14] U. M. Maurer, A Universal Statistical Test for Random Bit Generators, Journal of Cryptology, 5, 1992, 89-105. · Zbl 0790.94014
[15] C. H. Meyer and S. M. Matyas, Cryptography — A New Dimension in Data Security, John Wiley & Sons, New York, 1982. · Zbl 0584.94015
[16] A. N. Pettitt, A Non-parametric Approach to the Change-point Problem, Applied Statistics, 28, No. 2, 1979, 126-135. · Zbl 0438.62037
[17] R. A. Rueppel Analysis and Design of Stream Ciphers, Springer-Verlag, 1986.
[18] R. A. Rueppel, Stream Ciphers, Contemporary Cryptology: The Science of Information Integrity, G. J. Simmons ed., IEEE Press, New York, 1992, 65-134.
[19] C. E. Shannon, Communication Theory of Secrecy Systems, Bell System Technical Journal, 28, 1949, 656-715. · Zbl 1200.94005
[20] A. Shimizu and S. Miyaguchi, FEAL — Fast Data Encryption Algorithm, Systems and Computers in Japan, 19, No. 7, 1988, 20-34.
[21] M. A. Stephens and R.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.