Advertisement

Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register Sequence

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 658)

Abstract

Convergence of an algorithm for a linear feedback shift register initial state reconstruction using the noisy output sequence. based on a bitwise Bayesian iterative error-correction procedure and different weight parity-checks, is analyzed. It is proved that the self-composition of the Bayes error probability converges to zero if and only if the noise probability is less than a critical value expressed in terms of the numbers of parity-checks. An alternative approach to the critical noise estimation based on the residual error-rate after each iterative revision is also discussed.

Key words

Cryptanalysis Decoding Shift registers Fast correlation attack Algorithms Convergence 

References

  1. [1]
    T. Siegenthaler. “Decrypting a Class of Stream Ciphers Using Ciphertext Only”, IEEE Trans. Comput., vol. C-34, pp. 81–85, Jan. 1985.CrossRefGoogle Scholar
  2. [2]
    W. Meier, O. Staffelbach, “Fast Correlation Attacks on Certain Stream Ciphers”, Journal of Cryptology. vol. 1, pp. 159–176. 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    K. Zeng, M. Huang, “On the Linear Syndrome Method in Cryptanalysis”, Advances in Cryptology — CRYPTO’ 88, Lecture Notes in Computer Science, vol. 405, pp. 469–478. Springer-Verlag, 1990.Google Scholar
  4. [4]
    M. Mihaljević, J. Golić, “A Fast Iterative Algorthm for a Shift Register Initial State Reconstruction Given the Noisy Output Sequence”, Advances in Cryptology-AUSCRYPT’ 90, Lecture Notes in Computer Science, vol. 453, pp. 165–175. Springer-Verlag, 1990.CrossRefGoogle Scholar
  5. [5]
    K. Zeng, C.H. Yang, T.R.N. Rao, “An Improved Linear Syndrome Algorithm in Cryptanalysis with Applications”, Proc. CRYPTO’ 90.Google Scholar
  6. [6]
    M. Živković. “An Analysis of Linear Recurrent Sequences over the Field GF(2)”, Ph.D. thesis, Belgrade University, 1990.Google Scholar
  7. [7]
    V. Chepyzhov, B. Smeets. “On a Fast Correlation Attack on Stream Ciphers”, Advances in Cryptology-EUROCRYPT’ 91, Lecture Notes in Computer Science, vol. 547, pp. 176–185, Springer-Verlag, 1991.Google Scholar
  8. [8]
    M. Mihaljević, J. Golić. “A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction”, Advances in Cryptology — EUROCRYPT’ 91, Lecture Notes in Computer Science. vol. 547, pp. 527–531, Springer-Verlag. 1991.Google Scholar
  9. [9]
    R.G. Gallager, “Low-Density Parity-Check Codes”, IRE Trans. Inform. Theory, vol. IT-8, pp. 21–28, Jan. 1962.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  1. 1.Institute of Applied Mathematics and Electronics, Belgrade School of Electrical EngineeringUniversity of BelgradeBeogradYugoslavia

Personalised recommendations