Skip to main content
SpringerLink
Log in

On the Use of Asynchronous Cellular Automata in Symmetric-Key Cryptography

  • Conference paper
  • First Online:
Security in Computing and Communications (SSCC 2016)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 625))

Included in the following conference series:

Abstract

This paper addresses a symmetric key cryptosystem using rule 57 asynchronous cellular automata. It is experimentally shown that the proposed cryptosystem achieves the avalanche effect after 32000 iterations. The vulnerability of the proposed scheme is discussed and note that, brute-force attack is practically infeasible. The effectiveness of the scheme is compared with other cryptosystems and finally, it is also report that the proposed cryptosystem can easily be implemented in hardware.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. von Neumann, J.: The Theory of Self-reproducing Automata. University of Illinois Press, Urbana and London (1966). Edited by Burks, A.W

    Google Scholar 

  2. Bao, F.: 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 

  3. Kari, J.: Cryptosystems based on reversible cellular automata (1992, preprint)

    Google Scholar 

  4. Fatès, N., Thierry, E., Morvan, M., Schabanel, N.: Fully asynchronous behavior of double-quiescent elementary cellular automata. Theor. Comput. Sci. 362, 1–16 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Wolfram, S.: Theory and Applications of Cellular Automata. World Scientific, Singapore (1986)

    MATH  Google Scholar 

  6. Sethi, B., Roy, S., Das, S.: Asynchronous cellular automata and pattern classification. Complexity (2016). doi:10.1002/cplx.21749

    Google Scholar 

  7. Mahajan, P., Sachdeva, A.: A study of encryption algorithms AES, DES and RSA for security. Comput. Sci. & Tech. Netw. Web Secur. 13, 15–22 (2013)

    Google Scholar 

  8. Sethi, B., Fatès, N., Das, S.: Reversibility of elementary cellular automata under fully asynchronous update. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds.) TAMC 2014. LNCS, vol. 8402, pp. 39–49. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  9. Kari, J.: Reversible cellular automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 57–68. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. Sarkar, A., Mukherjee, A., Das, S.: Reversibility in asynchronous cellular automata. Complex Syst. 21, 71–84 (2012)

    MathSciNet  Google Scholar 

  11. Feistel, H.: Cryptography and computer privacy. Sci. Am. 228, 15–23 (1973)

    Article  Google Scholar 

  12. Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  13. Das, S., Sarkar, A., Sikdar, B.K.: Synthesis of reversible asynchronous cellular automata for pattern generation with specific hamming distance. In: Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2012. LNCS, vol. 7495, pp. 643–652. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Karimi, H., Hosseni, S.M., Jahan, M.V.: On the combination of self-organized systems to generate pseudo-random numbers. Inf. Sci. 221, 371–388 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science Engineering and Applications, Indira Gandhi Institute of Technology, Sarang, Dhenkanal, 759146, Odisha, India

    Biswanath Sethi

  2. Department of Information Technology, Indian Institute of Engineering Science and Technology, Shibpur, Howrah, 711103, West Bengal, India

    Sukanta Das

Authors
  1. Biswanath Sethi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sukanta Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Biswanath Sethi .

Editor information

Editors and Affiliations

  1. IBM ZURICH RESEARCH LABORATORY, IBM ZURICH RESEARCH LABORATORY, RUESCHLIKON, Switzerland

    Peter Mueller

  2. Technology and Management, Indian Institute of Information Technology and Management, Kerala, India

    Sabu M. Thampi

  3. Temple University, New York, New York, USA

    Md Zakirul Alam Bhuiyan

  4. Computer Science, University of Waikato Computer Science, Hamilton, New Zealand

    Ryan Ko

  5. Deakin University , Burwood, Victoria, Australia

    Robin Doss

  6. University of the West of Scotland , Paisley, Glasgow, United Kingdom

    Jose M. Alcaraz Calero

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Sethi, B., Das, S. (2016). On the Use of Asynchronous Cellular Automata in Symmetric-Key Cryptography. In: Mueller, P., Thampi, S., Alam Bhuiyan, M., Ko, R., Doss, R., Alcaraz Calero, J. (eds) Security in Computing and Communications. SSCC 2016. Communications in Computer and Information Science, vol 625. Springer, Singapore. https://doi.org/10.1007/978-981-10-2738-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-2738-3_3

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-2737-6

  • Online ISBN: 978-981-10-2738-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation