Advertisement

Clock Control Sequence Reconstruction in the Ciphertext Only Attack Scenario

  • Slobodan Petrović
  • Amparo Fúster-Sabater
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3269)

Abstract

Clock control sequence reconstruction is an important phase in the cryptanalysis of irregularly clocked Linear Feedback Shift Registers(LFSRs). The methods of reconstruction proposed so far have been designed to work in the known plaintext attack scenario, i.e. without noise. We present a clock control reconstruction procedure intended to function in the ciphertext only attack scenario. The reconstruction is performed by a directed depth-first like search through the edit distance matrix. The directedness of the search is achieved by gradually increasing the permitted weight deviation from the optimal one, and by limiting it according to the noise level in the statistical model of the generator. The experimental results show that the total number of candidate clock control sequences increases moderately as the probability of noise and/or the necessary clock control sequence length increase. The attack is effective even if the noise level is relatively high and the solution is guaranteed to be found.

Keywords

Cryptanalysis Irregular clocking Edit distance Correlation attack Directed search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Andrews, G.: The Theory of Partitions. Addison-Wesley, Reading (1976)zbMATHGoogle Scholar
  2. 2.
    Chambers, W., Golić, J.: Fast Reconstruction of Clock-Control Sequence. Electronics Letters 38(20), 1174–1175 (2002)CrossRefGoogle Scholar
  3. 3.
    Golić, J., Menicocci, R.: Edit Distance Correlation Attack on the Alternating Step Generator. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 499–512. Springer, Heidelberg (1997)Google Scholar
  4. 4.
    Golić, J., Mihaljević, M.: A Generalized Correlation Attack on a Class of Stream Ciphers Based on the Levenshtein Distance. Journal of Cryptology 3(3), 201–212 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Hirschberg, D.: Serial Computations of Levenshtein Distances. In: Apostolico, A., Galil, Z. (eds.) Pattern Matching Algorithms, pp. 123–141. Oxford University Press, Oxford (1997)Google Scholar
  6. 6.
    Johansson, T.: Reduced Complexity Correlation Attacks on Two Clock-Controlled Generators. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 342–356. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Oommen, B.: Constrained String Editing. Inform. Sci. 40(9), 267–284 (1986)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Slobodan Petrović
    • 1
  • Amparo Fúster-Sabater
    • 1
  1. 1.Institute of Applied Physics (C.S.I.C.)MadridSpain

Personalised recommendations