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

Cryptanalysis of a Cellular Automata Cryptosystem

  • Conference paper
Computational Intelligence and Security (CIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3802))

Included in the following conference series:

Abstract

In this paper we show that the new Cellular Automata Cryptosystem (CAC) is insecure and can be broken by chosen-plaintexts attack with little computation. We also restore the omitted parts clearly by deriving the rotating number δ of plaintext bytes and the procedure of Major CA. The clock circle Δ of Major CA and the key SN are also attacked.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Schneier, B.: Applied Cryptography. Wiley, New York (1996)

    Google Scholar 

  2. Sarkar, P.: A brief history of cellular automata. ACM Computing Surveys 32(1), 80–107 (2000)

    Article  Google Scholar 

  3. Guan, P.: Cellular automata public key cryptosystem. Complex System 1, 51–57 (1987)

    MATH  Google Scholar 

  4. kari, J.: Cryptosystems based on reversible cellular automata. Personal communication (1992)

    Google Scholar 

  5. Wolfram, S.: Cryptography with Cellular Automata. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)

    Google Scholar 

  6. Habutsu, T., Nishio, Y., Sasae, I., Mori, S.: A Secret Key Cryptosystem by Iterating a Chaotic Map. In: Proc. of Eurocrypt 1991, pp. 127–140. Springer, Heidelberg (1991)

    Google Scholar 

  7. Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and Applications of Cellular Automata in Cryptography. IEEE Trans. on Computers 43, 1346–1357 (1994)

    Article  Google Scholar 

  8. Gutowitz, H.: Cryptography with Dynamical Systems. In: Goles, E., Boccara, N. (eds.) Cellular Automata and Cooperative Phenomena. Kluwer Academic Press, Dordrecht (1993)

    Google Scholar 

  9. Tomassini, M., Perrenoud, M.: Stream Ciphers with One and Two-Dimensional Cellular Automata. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 722–731. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Tomassini, M., Sipper, M.: On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata. IEEE Trans. on Computers 49(10), 1140–1151 (2000)

    Google Scholar 

  11. Gutowitz, H.: Cryptography with Dynamical Systems. manuscript

    Google Scholar 

  12. Sen, S., Shaw, C.R., Chowdhuri, N., Chaudhuri, P.: Cellular automata base cryptosystem (CAC). In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 303–314. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  13. Feng, B.: Cryptanalysis of a new cellular automata cryptosystem. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 416–427. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, J., Cheng, X., Wang, X. (2005). Cryptanalysis of a Cellular Automata Cryptosystem. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596981_7

Download citation

  • DOI: https://doi.org/10.1007/11596981_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30819-5

  • Online ISBN: 978-3-540-31598-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics