Abstract
The fast correlation attack on the shrinking generator proposed by Zhang et al. in [8] has a room for improvement that the probability that the guessing bit is incorrect increases in certain case. In this paper, we propose a method to improve Zhang et al.’s attack. Reflecting our idea, the fast correlation attack on the shrinking and self-shrinking generator is more efficient than Zhang et al.’s attack in both data and computational complexities. For the shrinking generator, required keystream bits and computational complexity are reduced about 69% and 27%, respectively; For the self-shrinking generator, required keystream bits and computational complexity are reduced about 46% and 22%, respectively.
“This research was supported by the MIC(Ministry of Information and Communication), Korea, under the ITRC(Information Technology Research Center) support program supervised by the IITA(Institute of Information Technology Advancement)” (IITA-2006-(C1090-0603-0025)).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chose, P., Joux, A., Mitton, M.: Fast correlation attacks: an algorithmic point of view. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 209–221. Springer, Heidelberg (2002)
Chepyzhov, V.V., Johansson, T., Smeets, B.: A simple algorithm for fast correlation attacks on stream ciphers. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 181–195. Springer, Heidelberg (2001)
Coppersmith, D., Krawczyk, H., Mansour, Y.: The Shrinking Generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)
Kanso, A.A.: Clock-Controlled Genrators, Thesis submitted to the University of London for the degree of Doctor of Philosophy (1999), www.isg.rhul.ac.uk/alumni/thesis/kanso_a.pdf
Meier, W., Staffelbach, O.: The Self-Shrinking generator. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 205–214. Springer, Heidelberg (1995)
Mihaljevic, M.J.: A faster cryptanalysis of the self-shrinking generator. In: Pieprzyk, J.P., Seberry, J. (eds.) ACISP 1996. LNCS, vol. 1172, pp. 182–189. Springer, Heidelberg (1996)
Zenner, E., Krause, M., Lucks, S.: Improved Cryptanalysis of the Self-Shrinking Generator. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 21–35. Springer, Heidelberg (2001)
Zhang, B., Wu, H., Feng, D., Bao, F.: A Fast Correlation Attack on the Shrinking Generator. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 72–86. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeong, K., Sung, J., Hong, S., Lee, S., Kim, J., Hong, D. (2006). Improved Fast Correlation Attack on the Shrinking and Self-shrinking Generators. In: Nguyen, P.Q. (eds) Progress in Cryptology - VIETCRYPT 2006. VIETCRYPT 2006. Lecture Notes in Computer Science, vol 4341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11958239_17
Download citation
DOI: https://doi.org/10.1007/11958239_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68799-3
Online ISBN: 978-3-540-68800-6
eBook Packages: Computer ScienceComputer Science (R0)