[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

An improved key stream generator based on the programmable cellular automata

  • Session 5: Boolean Functions and Stream Ciphers
  • Conference paper
  • First Online:
Information and Communications Security (ICICS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1334))

Included in the following conference series:

Abstract

An improved programmable cellular automata (PCA) based key stream generator is proposed which originates from a recently proposed scheme for key stream generators based on the PCA and a read only memory. Cryptographic security examination of the proposed key stream generator is realized through the following two steps. As the first, an equivalent model of the generator is given, and it is shown that the generator is resistant on the known attacks. Than, a novel method for the cryptanalysis, is developed, and it is shown that the generator is not vulnerable on this approach assuming that PCA length is sufficiently large.

This research was supported by the Science Fund, Grant. No. 04M02.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.P. Chaudhuri, D.P. Chaudhuri, S. Nandi, and S. Chattopadhyay, Additive Cellular Automata, Theory and Applications vol. 1. New-York: IEEE Press,1997.

    Google Scholar 

  2. S. Wolfram, “Random sequence generation by cellular automata”, Advances in Applied Mathematics 7, pp. 123–169, 1986.

    Article  Google Scholar 

  3. S. Wolfram, “Cryptography with cellular automata”, Lecture Notes in Computer Science, vol. 218, pp. 429–432, 1986.

    Google Scholar 

  4. W. Diffie, “The first ten years of public-key cryptography”, Proc. IEEE, pp. 560–577, 1988.

    Google Scholar 

  5. S. Nandi, B.K. Kar, and P. Pal Chaudhuri, “Theory and applications of cellular automata in cryptography”, IEEE Trans. Computers, vol. 43, no. 12, pp. 1346–1357, Dec. 1994.

    Article  Google Scholar 

  6. W. Meier and O. Staffelbach, “Analysis of pseudo random sequences generated by cellular automata”, Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, vol. 547, pp. 186–199, 1992.

    Google Scholar 

  7. M. Mihaljević, “Security examination of certain cellular automata based key stream generator”, ISITA '96 — 1996 IEEE International Symposium on Information Theory and Its Applications, Canada, Victoria, B.C., September 1996, Proceedings, pp. 246–249.

    Google Scholar 

  8. M. Mihaljević, “Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach”, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-12, Lecture Notes in Computer Science, vol. 1255, pp. 250–262, 1997.

    Google Scholar 

  9. 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 

  10. 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. Computers, vol. 42, no. 3, pp. 340–352, Mar. 1993.

    Article  Google Scholar 

  11. P.D. Hortensius, R.D. McLeod, and H.C. Card, “Parallel pseudorandom number generation for VLSI systems using cellular automata”, IEEE Trans. Computers, vol. 38, no. 10, pp. 1466–1473, Oct. 1989.

    Article  Google Scholar 

  12. S. Nandi and P. Pal Chaudhuri, “Analysis of periodic and intermediate boundary 90/150 cellular automata”, IEEE Trans. Computers, vol. 45, no. 1, pp. 1–11, Jan. 1996.

    Article  Google Scholar 

  13. M. Serra, T. Slater, J.C. Muzio, and D.M. Miller, “The analysis of one-dimensional linear cellular automata and their aliasing properties”, IEEE Trans. ComputerAided Design, vol. 9, no. 7, pp. 767–778, July 1990.

    Article  Google Scholar 

  14. T. Siegenthaler, “Decrypting a class of stream ciphers using ciphertext only”, IEEE Trans. Computers, vol. C-34, no. 1, pp. 81–85, Jan. 1985.

    Google Scholar 

  15. M. Mihaljević, “A correlation attack on the binary sequence generators with timevarying output function”, Advances in Cryptology — ASIACRYPT '94, Lecture Notes in Computer Science, vol. 917, pp. 67–79, 1995.

    Google Scholar 

  16. J. Golić 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 

  17. 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 

  18. 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 

  19. 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 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Electronics Institute of Mathematics, Academy of Science and Arts, Belgrade, Yugoslavia

    Miodrag J. Mihaljević

Authors
  1. Miodrag J. Mihaljević
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Yongfei Han Tatsuaki Okamoto Sihan Qing

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag

About this paper

Cite this paper

Mihaljević, M.J. (1997). An improved key stream generator based on the programmable cellular automata. In: Han, Y., Okamoto, T., Qing, S. (eds) Information and Communications Security. ICICS 1997. Lecture Notes in Computer Science, vol 1334. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028474

Download citation

  • DOI: https://doi.org/10.1007/BFb0028474

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63696-0

  • Online ISBN: 978-3-540-69628-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation