Abstract
Embedding and probabilistic correlation attacks on clock-controlled shift registers that are clocked at least once per output symbol are defined in general and are analyzed in the unconstrained case, with an arbitrary number of deletions at a time, and in the constrained case, with at most d deletions at a time. It is proved that the unconstrained embedding attack is successful if and only if the deletion rate is smaller than one half and if the length of the observed keystream sequence is greater than a value linear in the shift register length r. It is shown how to compute recursively the joint probability which is a basis for the unconstrained probabilistic attack with independent deletions. The efficiency of the attack is characterized in terms of the capacity of the corresponding communication channel with independent deletions and it is concluded that the probabilistic attack is successful for any deletion rate smaller than one if the given keystream sequence is sufficiently long, also linearly in r. It is proved that the constrained embedding attack is successful for any d and the minimum necessary length of the known output sequence is shown to be linear in r, and at least exponential and at most superexponential in d. This demonstrates that making d large can not ensure the theoretical security against the attack, but can considerably improve the practical security.
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.
The work reported in this paper has been funded in part by the Cooperative Research Centres program through the Department of the Prime Minister and Cabinet of Australia.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. G. Chambers and D. Gollmann. Lock-in effect in cascades of clock-controlled shift registers. Advances in Cryptology, EUROCRYPT '88, Lecture Notes in Computer Science, vol. 330, C. G. Günther ed., Springer-Verlag, pages 331–342, 1988.
D. Coppersmith, H. Krawczyk, and Y. Mansour. The shrinking generator. Pre-Proceedings of CRYPTO '93, pages 3.1–3.11, 1993.
C. Ding, G. Xiao, and W. Shan. The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science, vol. 561, Berlin: Springer-Verlag, 1991.
A. S. Dolgopolov. Capacity bounds for a channel with synchronization errors. Prob. Peredachi Inform. (in russian), 26:27–37, 1990.
W. Feller. An Introduction to Probability Theory and its Applications. New York: Wiley, 3rd edition, Volume 1, 1968.
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, pages 472–476, 1992.
J. Dj. Golić and M. V. Živković. On the linear complexity of nonuniformly decimated PN-sequences. IEEE Transactions on Information Theory, 34:1077–1079, Sept. 1988.
D. Gollmann and W. G. Chambers. Clock controlled shift registers: a review. IEEE Journal on Selected Areas in Communications, 7(4):525–533, 1989.
D. Gollmann and W. G. Chambers. A cryptanalysis of stepk,m-cascades. Advances in Cryptology, EUROCRYPT '89, Lecture Notes in Computer Science, vol. 434, J.-J. Quisquater, J. Vandewalle eds., Springer-Verlag, pages 680–687, 1990.
P. A. V. Hall and G. R. Dowling. Approximate string matching. Computing Surveys, 12:381–402, Dec. 1980.
J. Hopcroft and J. Ullman. An Introduction to Automata, Languages and Computation. Reading, MA: Addison Wesley, 1979.
R. Menicocci. Short Gollmann cascade generators are insecure. Abstracts of the Fourth IMA Conference on Coding and Cryptography, Cirencester, 1993.
R. Menicocci. Cryptanalysis of a two-stage Gollmann cascade generator. Proceedings of SPRC '93, Rome, pages 62–69, 1993.
M. J. Mihaljević. An approach to the initial state reconstruction of a clock-controlled shift register based on a novel distance measure. Advances in Cryptology, AUSCRYPT '92, Lecture Notes in Computer Science, vol. 718, J. Seberry and Y. Zheng eds., Spinger-Verlag, pages 349–356, 1993.
F. Roberts. Applied Combinatorics. Englewood Cliffs, NJ: Prentice Hall, 1984.
M. V. Živković. An algorithm for the initial state reconstruction of the clock-controlled shift register. IEEE Transactions on Information Theory, 37:1488–1490, Sept. 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golić, J.D., O'Connor, L. (1995). Embedding and probabilistic correlation attacks on clock-controlled shift registers. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053439
Download citation
DOI: https://doi.org/10.1007/BFb0053439
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive