Abstract
The Ziv-Lempel complexity is a well-known complexity measure. In our paper we consider the Ziv-Lempel complexity for periodic sequences as well as for pseudorandom number sequences. Further on, we will look at its cryptographic significance and compare it with other complexity measures such as the linear complexity.
Chapter PDF
Similar content being viewed by others
8 References
A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, R. McConnel: Linear Size Finite Automata for the Set of all Subwords of a Word, An Outline of Results, Bul. Eur. Assoc. Theor. Comp. Sci., No. 21, 1983, pp. 12–20
C. Jansen: Investigations On Nonlinear Streamcipher Systems: Construction and Evaluation Methods, PhD. Thesis
A. Lempel, J. Ziv: On the Complexity of Finite Sequences, IEEE Transaction on Information Theory, IT-22, No. 1
A. Leung, S. Tavares: Sequence Complexity as aTest for Cryptographic Systems, Advances in Cryptology-Crypto 84, lecture Notes in Computer Science, springer Verlag, Heidelberg, 1985
86]_R. Rueppel: Analysis and Design of Stream Ciphers, Springer Verlag, Berlin, 1986
M. Wang: Cryptographic Aspects of Sequence Complexity Measures, PhD. Thesis, ETH Zürich, 1988
J. Ziv: Coding Theorems for Individual Sequences, IEEE Transaaction on Information Theory, IT-24, No. 4
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mund, S. (1991). Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_10
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive