Ziv-Lempel complexity for periodic sequences and its cryptographic application

Authors:
Sibylle Mund
Affiliations:
Siemens AG, München, West Germany
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 4
Cited 1

Analysis and design of stream ciphers

Analysis and design of stream ciphers
Sequence complexity as a test for cryptographic systems

Proceedings of CRYPTO 84 on Advances in cryptology
On the Complexity of Finite Sequences

IEEE Transactions on Information Theory
Coding theorems for individual sequences

IEEE Transactions on Information Theory

On lempel-ziv complexity of sequences

SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

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.