Advertisement

Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach

  • Miodrag J. Mihaljev'c
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1255)

Abstract

A recently proposed scheme for key stream generators based on the programmable cellular automata and a read only memory is considered. It is shown that, the effective secret key size is significantly smaller than its formal length. The scheme is cryptanalyzed assuming ciphertext only attack, and novel cryptanalytic approach is proposed much more efficient than the reported one based on the known plaintext attack. As a development of the proposed basic algorithm for the secret key reconstruction the fast one is also given. Efficiency of the fast algorithm originates from the iterative error-correction procedure based on the algebraic replica approach.

Keywords

Cellular Automaton Cellular Automaton Stream Cipher Plaintext Attack Correlation Attack 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Wolfram, “Random sequence generation by cellular automata”, Advances in Applied Mathematics 7, pp. 123–169, 1986.CrossRefGoogle Scholar
  2. 2.
    S. Wolfram, “Cryptography with cellular automata”, Lecture Notes in Computer Science, vol. 218, pp. 429–432, 1986.Google Scholar
  3. 3.
    W. Meier and O. Staffelbach, “Analysis of pseudo random sequences generated by cellular automata”, Lecture Notes in Computer Science, vol. 547, pp. 186–199, 1992.Google Scholar
  4. 4.
    W. Diffie, “The first ten years of public-key cryptography”, Proc. IEEE, pp. 560–577, 1988.Google Scholar
  5. 5.
    A.K. Das, A. Gonguly, A. Dasgupta, S. Bhawmik, and P. Pal Chaudhuri, “Efficient characterization of cellular automata”, IEE Proc., Pt. E, vol. 137, no. 1, pp. 81–87, Jan. 1990.Google Scholar
  6. 6.
    A.K. Das and P. Pal Chaudhuri, “Vector space theoretic analysis of additive cellular automata and its applications for pseudo-exhaustive test pattern generation”, IEEE Trans. Comput., vol. 42, no. 3 pp. 340–352, Mar. 1993.Google Scholar
  7. 7.
    S. Nandi, B.K. Kar, and P. Pal Chaudhuri, “Theory and applications of cellular automata in cryptography”, IEEE Trans. Comput., vol. 43, no. 12, pp. 1346–1357, Dec. 1994.Google Scholar
  8. 8.
    T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. Comput., vol. C-34, no. 1, pp. 81–85, Jan. 1985.Google Scholar
  9. 9.
    M. Mihaljević, “A Correlation Attack on the Binary Sequence Generators with Time-Varying Output Function”, Advances in Cryptology-ASIACRYPT '94, Lecture Notes in Computer Science, vol. 917, pp. 67–79, 1995.Google Scholar
  10. 10.
    J. Golic and M. 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
  11. 11.
    M. Mihaljević and J. Golić, “A fast iterative algorithm 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, 1990.Google Scholar
  12. 12.
    M. Mihaljević and 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, 1992.Google Scholar
  13. 13.
    M. Mihaljević and J. Golić, “Convergence of a Bayesian iterative error-correction 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Miodrag J. Mihaljev'c
    • 1
  1. 1.Institute of Applied Mathematics and Electronics Institute of MathematicsAcademy of Science and ArtsBelgradeYugoslavia

Personalised recommendations