Advertisement

A correlation attack on the binary sequence generators with time-varying output function

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

Abstract

A binary sequence generator (BSG) consisting of three regularly clocked linear feedback shift registers combined by a time-varying memoryless function is cryptanalysed. A novel distance measure for the binary sequences comparison relevant for the crypanalysis is proposed, its main characteristics are derived, and the divide and conquer correlation attack based on this distance is presented. It is pointed out that the novel distance based approach to cryptanalysis could be applied for attacking the binary MacLaren-Marsaglia shuffler, for signficant improvement of the correlation attack on the multiplexer BSG, and for attacking a wide class of BSG's in which the output binary sequence is a time-varying function of certain subgenerator output binary sequence.

Key words and phrases

Binary sequence generators MacLaren-Marsaglia shuffler Cryptanalysis Correlation attack Distance measures 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Siegenthaler, ”Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. Comput., vol. 34, pp. 81–85, Jan. 1985.Google Scholar
  2. 2.
    W. Meier and O. Staffelbach, ”Fast correlation attacks on certain stream ciphers”, Journal of Cryptology, vol. 1, pp. 159–176, 1989.Google Scholar
  3. 3.
    K.C. Zeng and M. Huang, ”On the linear syndrome algorithm in cryptanalysis with applications”, Advances in Cryptology — CRYPTO '88, Lecture Notes in Computer Science, vol. 403, pp. 469–478, 1990.Google Scholar
  4. 4.
    M.J. Mihaljević and J.Dj. Golić, ”Convergence of a Bayesian iterative errorcorrection procedure on a noisy shift register sequence”, Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, vol. 658, pp. 124–137, 1993.Google Scholar
  5. 5.
    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, vol. 3, pp. 201–212, 1991.Google Scholar
  6. 6.
    J.Dj. Golić, ”On the security of shift register based keystream generators”, Fast Software Encryption, Lecture Notes in Computer Science, vol. 809, pp. 91–101, 1994.Google Scholar
  7. 7.
    M.D. MacLaren and G. Marsaglia, ”Uniform random number generators”, Jour. Ass. Comput. Machnery, vol. 12, pp. 93–89, 1968.Google Scholar
  8. 8.
    W.G. Chambers, ”Clock-controlled shift registers in binary sequence generators”, IEE Proceedings, Pt. E, vol. 135, pp. 17–23, 1988.Google Scholar
  9. 9.
    G. Marsaglia and T.A. Bray, ”One-line random number generators and their use in combinations”, Comm. Ass. Comput. Machinery, vol. 11, pp. 757–759, 1968.Google Scholar
  10. 10.
    D.E. Knuth, The art of computer programming Vol.2: Seminumerical algorithms. Reading, MA: Addison-Wesley, 1981.Google Scholar
  11. 11.
    C.T. Retter, ”A key-search attack on MacLaren-Marsaglia system”, Cryptologia, vol. 9, pp. 114–130, 1985.Google Scholar
  12. 12.
    J.Dj. Golić and M.J. Mihaljević, ”Minimal linear equivalent analysis of a variable memory binary sequences generator”, IEEE Trans. Inform. Theory, vol. 36, pp. 190–192, 1990.Google Scholar
  13. 13.
    P.R. Geffe, ”How to protect data with ciphers that are really hard to break”, Electronics, pp. 99–101, Jan. 1973.Google Scholar
  14. 14.
    J.Dj. Golić, ”The number of output sequences of a binary sequence generator”, Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, vol. 547, pp. 160–167, 1991.Google Scholar
  15. 15.
    R. Menicocci, ”Intrinsic weakness of variable-memory keystream generators”, Electronics Letters, vol. 30, No. 11, pp. 850–851, 1994.Google Scholar
  16. 16.
    S.M. Jennings, ”Multiplexed sequences: Some properties of the minimum polynomial”, Proc. Workshop on Cryptography, Lecture Notes in Computer Science, vol. 149, pp. 189–206, 1982.Google Scholar
  17. 17.
    D.Sankoff and J.B.Kruskal, Time warps, string edits and macromolecules: The theory and practice of sequence comparison. Reading, MA: Addison-Wesley, 1983.Google Scholar
  18. 18.
    A.Levenshtein, ”Binary codes capable of correcting deletions, insertions, and reversals”, Sov. Phy. Dokl., vol. 10, pp. 707–710, 1966.Google Scholar
  19. 19.
    P.A. Devijver and J. Kittler, Pattern recognition: A statistical approach. London: Prentice Hall, 1982.Google Scholar
  20. 20.
    K.C. Zeng, C.H. Yang, and T.R.N. Rao, ”On the linear consistency test (LCT) in cryptanalysis and its applications”, Advances in Cryptology — CRYPTO '90, Lecture Notes in Computer Science, vol. 537, pp. 34–47, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Miodrag J. Mihaljević
    • 1
  1. 1.Institute of Applied Mathematics and Electronics, Institute of MathematicsAcademy of Arts and SciencesBelgradeYugoslavia

Personalised recommendations