Abstract
The complexity of a finite sequence as defined by Lempel and Ziv is advocated as the basis of a test for cryptographic algorithms. Assuming binary data and block enciphering, it is claimed that the difference (exclusive OR sum) between the plaintext vector and the corresponding ciphertext vector should have high complexity, with very high probability. We may refer to this as plaintext/ciphertext complexity. Similarly, we can estimate an “avalanche” or ciphertext/ ciphertext complexity. This is determined by changing the plaintext by one bit and computing the complexity of the difference of the corresponding ciphertexts. These ciphertext vectors should appear to be statistically independent and thus their difference should have high complexity with very high probability. The distribution of com plexity of randomly selected binary blocks of the same length is used as a reference. If the distribution of complexity generated by the cryptographic algorithm matches well with the reference distribution, the algorithm passes the complexity test. For demonstration, the test is applied to modulo multiplication and to successive rounds (iterations) of the DES encryption algorithm. For DES, the plaintext/ ciphertext complexity test is satisfied by the second round, but the avalanche complexity test takes four to five rounds before a good fit is obtained.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Lempel and J. Ziv, “On the complexity of finite sequences”, IEEE Trans. on Inform. Theory, Vol. IT-22, Jan. 1976, pp. 75–81.
E. Fischer, “A Theoretical Measure of Cryptographic Performance”, Cryptologia, Vol. 5, Jan. 1981, pp. 59–62.
E. Fischer, “Measuring cryptographic performance with production processes”, Cryptologia, Vol. 5, Jul. 1981, pp. 158–162.
M.E. Spencer and S.E. Tavares, “Layered Broadcast cryptographic systems”, Advances in Cryptology: Proceedings of Crypto’ 83, Plenum Press 1984, pp. 157–170.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leung, A.K., Tavares, S.E. (1985). Sequence Complexity as a Test for Cryptographic Systems. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_38
Download citation
DOI: https://doi.org/10.1007/3-540-39568-7_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15658-1
Online ISBN: 978-3-540-39568-3
eBook Packages: Springer Book Archive