Abstract
A novel edit distance between two binary input strings and one binary output string of appropriate lengths which incorporates the stop/go clocking in the alternating step generator is introduced. An efficient recursive algorithm for the edit distance computation is derived. The corresponding correlation attack on the two stop/go clocked shift registers is then proposed. By systematic computer simulations, it is shown that the minimum output segment length required for a successful attack is linear in the total length of the two stop/go clocked shift registers. This is verified by experimental attacks on relatively short shift registers.
This work was done while the first author was with the Information Security Research Centre, Queensland University of Technology, Brisbane, Australia. Part of this work was carried out while the first author was on leave at the Isaac Newton Institute for Mathematical Sciences, Cambridge, United Kingdom. This research was supported in part by the Science Fund of Serbia, grant #04M02, through the Mathematical Institute, Serbian Academy of Science and Arts.
Chapter PDF
Key words
References
T. Beth and F. C. Piper, ”The stop-and-go generator,” Advances in Cryptology — EUROCRYPT '84, Lecture Notes in Computer Science, vol. 209, T. Beth, N. Cot, and I. Ingemarsson eds., Springer-Verlag, pp. 88–92, 1985.
J. Dj. Golić and M. Mihaljević, ”A generalized correlation attack on a class of stream ciphers based on the Levenshtein distance,” Journal of Cryptology, vol. 3(3), pp. 201–212, 1991.
J. Dj. Golić and S. Petrovic, ”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ć 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, A. De Santis ed., Springer-Verlag, pp. 230–243, 1995.
J. Dj. Golić, ”Constrained embedding probability for two binary strings,” SIAM Journal on Discrete Mathematics, vol. 9(3), pp. 360–364, 1996.
J. Dj. Golić, ”Edit distance correlation attacks on clock-controlled combiners with memory,” Information Security and Privacy, Lecture Notes in Computer Science, vol. 1172, J. Pieprzyk ed., Springer-Verlag, pp. 169–181, 1996.
D. Gollmann and W. G. Chambers, ”Clock-controlled shift registers: a review,” IEEE Journal on Selected Areas in Communications, vol. 7, pp. 525–533, May 1989.
C. G. Günther, ”Alternating step generators controlled by de Bruijn sequences,” Advances in Cryptology — EUROCRYPT '87, Lecture Notes in Computer Science, vol. 304, D. Chaum and W. L. Price eds., Springer-Verlag, pp. 5–14, 1988.
J. L. Massey, ”Shift-register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
R. Menicocci, ”Cryptanalysis of a two-stage Gollmann cascade generator,” Proceedings of SPRC '93, Rome, Italy, pp. 62–69, 1993.
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, G. Brassard ed., Springer-Verlag, pp. 164–174, 1990.
K. Zeng, G. 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.
M. V. Živković, “An algorithm for the initial state reconstruction of the clock-controlled shift register,” IEEE Trans. Inform. Theory, vol. IT-37, pp. 1488–1490, Sept. 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Golić, J.D., Menicocci, R. (1997). Edit distance correlation attack on the alternating step generator. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052258
Download citation
DOI: https://doi.org/10.1007/BFb0052258
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive