Advertisement

An approach to the initial state reconstruction of a clock-controlled shift register based on a novel distance measure

  • Miodrag J. Mihaljevic
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 718)

Abstract

The initial state reconstruction problem of a clock-controlled shift register is considered when the characteristic polynomial, a segment of the output sequence and the probability of ones in the clock sequence are known. This problem is more general than the considered one (in [2]), and it is solved using a quite different approach. A novel distance measure for comparison of two different length binary sequences is proposed and its main characteristics relevant for the cryptanalysis is derived. An algorithm for the cryptanalysis based on the proposed distance measure is presented and its main characteristics are pointed out. Expected minimal length of the observed sequence for the unique initial state solution is estimated. Illustrative numerical examples are included.

Key words and phrases

Cryptanalysis Key-stream generators Clock-controlled shift register Correlation attack Sequence comparison Distance measures Algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Gollman and W.G. Chambers, Clock-controlled shift registers: A review, IEEE Journal on Selected Areas in Communications, Volume SAC-7, May (1989) 525–533Google Scholar
  2. 2.
    M. Zivkovic, An algorithm for the initial state reconstruction of the clock-controlled shift register, IEEE Trans. Information Theory, Volume 37, September (1991) 1488–1490Google Scholar
  3. 3.
    J. Golic and M. Mihaljevic, A generalised correlation attack on a class of stream ciphers based on the Levenshtein distance, Journal of Cryptology, Volume 3 (3), (1991) 201–212Google Scholar
  4. 4.
    D. Sankoff and J.B. Kruskal, Time Warps, String Edits and Macro Molecules: The Theory and Practice of Sequence Comparison. Reading, MA: Addison-Wesley, 1983.Google Scholar
  5. 5.
    A Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phy. Dokl., Volume 10, (1966) 707–710Google Scholar
  6. 6.
    B.J. Oommen, Recognition of noisy subsequences using constrained edit distance. IEEE Trans Pattern Analysis Mach. Intell., Volume PAMI-9, September (1987) 636–685Google Scholar
  7. 7.
    B.J. Oommen, Correction to recognition of noisy subsequences using constrained edit distance, IEEE Trans. Pattern Analysis Mach. Intell., Volume PAMI-10, November (1988) 983–984, November 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Miodrag J. Mihaljevic
    • 1
  1. 1.Institute of Applied Mathematics and ElectronicsInstitute of Mathematics Academy of Arts and SciencesBelgradeYugoslavia

Personalised recommendations