Abstract
A theoretical framework for fast correlation attacks on irreg- ularly clocked linear feedback shift registers (LFSRs) based on a recently established linear statistical weakness of decimated LFSR sequences is developed. When the LFSR feedback polynomial is not known, methods for the statistical weakness detection and the feedback polynomial recon- struction are proposed. When the LFSR feedback polynomial is known, an iterative procedure for fast LFSR initial state reconstruction given an observed keystream sequence is introduced. The procedure is based on appropriately defined parity-check sums and consists in iterative re- computation of the posterior probabilities for unknown elements of the decimation sequence. A convergence condition in terms of the numbers of the parity-check sums needed for successful reconstruction and the re- quired polynomial computational complexity indicate that the proposed fast correlation attack may be realistic, especially in the constrained clocking case. The number of the feedback polynomial multiples of rela- tively low weight and not too large degree thus proves to be critical for the security of irregularly clocked LFSRs.
This research was supported in part by the Science Fund of Serbia, grant #0403, through the Institute of Mathematics, Serbian Academy of Arts and Sciences.
Chapter PDF
References
R. J. Anderson, “Solving a class of stream ciphers,” Cryptologia, 14(3):285–288, 1990.
R. J. Anderson, “Faster attack on certain stream ciphers,” Electr. Lett., 29(15):1322–1323, July 1993.
V. Chepyzhov and B. Smeets, “On a fast correlation attack on stream ciphers,” Advances in Cryptology — EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, D. V. Davies ed., Springer-Verlag, pp. 176–185, 1991.
D. Coppersmith, H. Krawczyk, and Y. Mansour, “The shrinking generator,” Advances in Cryptology — CRYPTO’ 93, Lecture Notes in Computer Science, vol. 773, D. R. Stinson ed., Springer-Verlag, pp. 22–39, 1994.
J. Dj. Golić and M. V. Živković, “On the linear complexity of nonuniformly decimated PN-sequences,” IEEE Trans. Inform. Theory, 34:1077–1079, Sep. 1988.
J. Dj. Golić and M. J. Mihaljević, “A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance,” Journal of Cryptology, 3(3):201–212, 1991.
J. Dj. Golić and S. V. Petrović, “A generalized correlation attack with a probabilistic constrained edit distance,” Advances in Cryptology — EUROCRYPT’ 92, Lecture Notes in Computer Science, vol. 658, R. A. Rueppel ed., Springer-Verlag, pp. 472–476, 1993.
J. Dj. Golić, “Correlation via linear sequential circuit approximation of combiners with memory,” Advances in Cryptology — EUROCRYPT’ 92, Lecture Notes in Computer Science, vol. 658, R. A. Rueppel ed., Springer-Verlag, pp. 113–123, 1993.
J. Dj. Golić, “On the security of shift register based keystream generators,” Fast Software Encryption — Cambridge’ 93, Lecture Notes of Computer Science, vol. 809, R. J. Anderson ed., Springer-Verlag, pp. 90–100, 1994.
J. Dj. Golić and L. O’Connor, “Embedding and probabilistic correlation attacks on clock-controlled shift registers,” Pre-proceedings of Eurocrypt’ 94, pp. 231–243, Perugia, Italy, 1994.
J. Dj. Golić, “Intrinsic statistical weakness of keystream generators,” Pre-proceedings of Asiacrypt’ 94, pp. 72–83, Wollongong, Australia, 1994.
D. Gollmann and W. G. Chambers, “Clock controlled shift registers: a review,” IEEE J. Sel. Ar. Commun., 7(4):525–533, 1989.
W. Meier and O. Staffelbach, “Fast correlation attacks on certain stream ciphers,” Journal of Cryptology, 1(3):159–176, 1989.
W. Meier and O. Staffelbach, “The self-shrinking generator,” Pre-proceedings of Eurocrypt’ 94, pp. 201–210, Perugia, Italy, 1994.
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, D. V. Davies ed., Springer-Verlag, 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, R. A. Rueppel ed., Springer-Verlag, pp. 124–137, 1993.
R. A. Rueppel, “Stream ciphers,” in Contemporary Cryptology: The Science of Information Integrity, G. Simmons ed., pp. 65–134. New York: IEEE Press, 1991.
T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only,” IEEE Trans. Comput., 34:81–85, Jan. 1985.
K. C. Zeng and M. Huang, “On the linear syndrome method in cryptanalysis,” Advances in Cryptology — CRYPTO’ 88, Lecture Notes in Computer Science, vol. 403, S. Goldwasser ed., Springer-Verlag, pp. 469–478, 1990.
K. C. Zeng, C. H. Yang, and T. R. N. Rao, “An improved linear syndrome algorithm in cryptanalysis with applications,” Advances in Cryptology — CRYPTO’ 90, Lecture Notes in Computer Science, vol. 537, A. J. Menezes and S. A. Vanstone eds., Springer-Verlag, pp. 34–47, 1991.
K. C. Zeng, C. H. Yang, and T. R. N. Rao, “On the linear consistency test (LCT) in cryptanalysis and its applications,” Advances in Cryptology — CRYPTO’ 89, Lecture Notes in Computer Science, vol. 435, G. Brassard ed., Springer-Verlag, pp. 164–174, 1990.
M. V. Živković, “On two probabilistic decoding algorithms for binary linear codes,” IEEE Trans. Inform. Theory, 37:1707–1716, Nov. 1991.
M. V. Živković, “An algorithm for the initial state reconstruction of the clock-controlled shift register,” IEEE Trans. Inform. Theory, 37:1488–1490, Sep. 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golić, J.D. (1995). Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_20
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive