Abstract
In the stability theory of stream ciphers, the philosophy is that a good keystream should not only have a large linear complexity, but that a small number of bit changes should not cause a significant drop in the linear complexity. This requirement leads to the concept of the k -error linear complexity L n , k (S) of a bit string S of length n. The main results of the paper concern the number of bit strings S of length n with a given value of L n , k (S) or with a given upper bound on L n , k (S). On the basis of these results, bounds for the expected value of L n , k (S) for fixed n and k and random bit strings S of length n are established.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G. Cohen, L Honkala, S. Litsyn, and A. Lobstein, “Covering Codes”, Elsevier, Amsterdam, 1997.
C. Ding, G. Xiao, and W. Shan, “The Stability Theory of Stream Ciphers”, Lecture Notes in Computer Science, Vol. 561, Springer-Verlag, Berlin, 1991.
F.G. Gustayson, Analysis of the Berlekamp-Massey linear feedback shift-register synthesis algorithm, IBM J. Res. Develop. 20 (1976), 204–212.
T. Kaida, S. Uehara, and K. Imamura, A new algorithm for the k -error linear complexity of sequences over GF(pm)with period pn, this volume.
H. Niederreiter, Sequences with almost perfect linear complexity profile, in “Advances in Cryptology — EUROCRYPT ‘87” (D. Chaum and W.L. Price, eds.), Lecture Notes in Computer Science, Vol. 304, pp. 37–51, Springer-Verlag, Berlin, 1988.
H. Niederreiter, Some computable complexity measures for binary sequences, this volume.
R.A. Rueppel, “Analysis and Design of Stream Ciphers”, Springer-Verlag, Berlin, 1986.
R.A. Rueppel, Stream ciphers, in “Contemporary Cryptology: The Science of Information Integrity” (G.J. Simmons, ed.), pp. 65–134, IEEE Press, New York, 1992.
M. Stamp and C.F. Martin, An algorithm for the k -error linear complexity of binary sequences with period 2n IEEE Trans. Inform. Theory 39 (1993), 1398–1401.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London
About this paper
Cite this paper
Niederreiter, H., Paschinger, H. (1999). Counting Functions and Expected Values in the Stability Theory of Stream Ciphers. In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_24
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0551-0_24
Publisher Name: Springer, London
Print ISBN: 978-1-85233-196-2
Online ISBN: 978-1-4471-0551-0
eBook Packages: Springer Book Archive