Abstract
The shrinking generator is a well-known keystream generator composed of two linear feedback shift registers, LFSR1 and LFSR2, where LFSR1 is clock-controlled according to regularly clocked LFSR2. A probabilistic analysis of the shrinking generator which shows that this generator can be vulnerable to a specific fast correlation attack is conducted. The first stage of the attack is based on a recursive computation of the posterior probabilites of individual bits of the regularly clocked LFSR1 sequence when conditioned on a given segment of the keystream sequence. Theoretical analysis shows that these probabilities are significantly different from one half and can hence be used for reconstructing the initial state of LFSR1 by iterative probabilistic decoding algorithms for fast correlation attacks on regularly clocked LFSR’s. In the second stage of the attack, the initial state of LFSR2 is reconstructed in a similar way, which is based on a recursive computation of the posterior probabilites of individual bits of the LFSR2 sequence when conditioned on the keystream sequence and on the reconstructed LFSR1 sequence.
Chapter PDF
Similar content being viewed by others
Keywords
References
D. Coppersmith, H. Krawczyk, and Y. Mansour, ”The shrinking generator,” Advances in Cryptology-CRYPTO’ 93, Lecture Notes in Computer Science, vol. 773, pp. 22–39, 1993.
J. Daemen, R. Govaerts, and J. Vandewalle, ”Resynchronization weakness in synchronous stream ciphers,” Advances in Cryptology-EUROCRYPT’ 93, Lecture Notes in Computer Science, vol. 765, pp. 159–167, 1994.
J. Dj. Golić, ”Intrinsic statistical weakness of keystream generators,” Advances in Cryptology-ASIACRYPT’ 94, Lecture Notes in Computer Science, vol. 917, pp. 91–103, 1995.
J. Dj. Golić and L. O’Connor, ”Embedding and probabilistic correlation attacks on clock-controlled shift registers,” Advances in Cryptology-EUROCRYPT’ 94, Lecture Notes in Computer Science, vol. 950, pp. 230–243, 1995.
J. Dj. Golić, ”Towards fast correlation attacks on irregularly clocked shift registers,” Advances in Cryptology-EUROCRYPT’ 95, Lecture Notes in Computer Science, vol. 921, pp. 248–262, 1995.
J. Dj. Golić and R. Menicocci, ”Edit probability correlation attack on the alternating step generator,” Sequences and their Applications-SETA’ 98, Discrete Mathematics and Theoretical Computer Science, C. Ding, T. Helleseth, and H. Niederreiter eds., Springer-Verlag, pp. 213–227, 1999.
J. Dj. Golić, ”Iterative probabilistic decoding and parity checks with memory,” Electronics Letters, vol. 35(20), pp. 1721–1723, Sept. 1999.
J. Dj. Golić, M. Salmasizadeh, and E. Dawson, ”Fast correlation attacks on the summation generator,” Journal of Cryptology, vol. 13, pp. 245–262, 2000.
T. Johansson, ”Reduced complexity correlation attacks on two clock-controlled generators,” Advances in Cryptology-ASIACRYPT’ 98, Lecture Notes in Computer Science, vol. 1514, pp. 342–357, 1998.
T. Johansson and F. Jonnson, ”Improved fast correlation attacks on stream ciphers via convolutional codes,” Advances in Cryptology-EUROCRYPT’ 99, Lecture Notes in Computer Science, vol. 1592, pp. 347–362, 1999.
W. Meier and O. Staffelbach, ”Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, vol. 1, pp. 159–176, 1989.
M. J. Mihaljević and J. Dj. Golić, ”A comparison of cryptanalytic principles based on iterative error-correction,” Advances in Cryptology-EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, pp. 527–531, 1991.
M. J. Mihaljević and J. Dj. Golić, ”Convergence of a Bayesian iterative error-correction procedure on a noisy shift register sequence,” Advances in Cryptology-EUROCRYPT’ 92, Lecture Notes in Computer Science, vol. 658, pp. 124–137, 1993.
M. J. Mihaljević, M. P. C. Fossorier, and H. Imai, ”A low-complexity and high-performance algorithm for the fast correlation attack,” Fast Software Encryption-New York 2000, Lecture Notes in Computer Science, vol. 1978, pp. 196–212, 2001.
L. Simpson, J. Dj. Golić, and E. Dawson, ”A probabilistic correlation attack on the shrinking generator,” Information Security and Privacy-Brisbane’ 98, Lecture Notes in Computer Science, vol. 1438, pp. 147–158, 1998.
L. Simpson, J. Dj. Golić, M. Salmasizadeh, and E. Dawson, ”A fast correlation attack on multiplexer generators,” Information Processing Letters, vol. 70, pp. 89–93, 1999.
K. Zeng, C. H. Yang, and T. R. N. Rao, ”On the linear consistency test (LCT) in cryptanalysis with applications,” Advances in Cryptology-CRYPTO’ 89, Lecture Notes in Computer Science, vol. 435, pp. 164–174, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golić, J.D. (2001). Correlation Analysis of the Shrinking Generator. In: Kilian, J. (eds) Advances in Cryptology — CRYPTO 2001. CRYPTO 2001. Lecture Notes in Computer Science, vol 2139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44647-8_26
Download citation
DOI: https://doi.org/10.1007/3-540-44647-8_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42456-7
Online ISBN: 978-3-540-44647-7
eBook Packages: Springer Book Archive