Skip to main content
SpringerLink
Log in

CSHR: Selection of Cryptographically Suitable Hybrid Cellular Automata Rule

  • Conference paper
Cellular Automata (ACRI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7495))

Included in the following conference series:

Abstract

In this paper a new procedure has been proposed to synthesize cellular automata (CA) with hybrid rulesets which are very well suited for designing cryptographic primitives. These rulesets are analyzed with respect to nonlinearity, algebraic degree, d-monomial test etc. A new graph theoretic property has also been proposed to analyze the cryptographic strength of cellular automata rules. The randomness of the sequences generated by the rulesets has been tested by NIST test-suite. The experimental results are compared with the existing related works and have shown to be out-performed.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blackburn, S.r., Murphy, S., Paterson, K.g.: Comments on ”theory and applications of cellular automata in cryptography”. IEEE Transactions on Computers 46, 637–638 (1997)

    Article  MathSciNet  Google Scholar 

  2. Filiol, É.: A New Statistical Testing for Symmetric Ciphers and Hash Functions. In: Deng, R.H., Qing, S., Bao, F., Zhou, J. (eds.) ICICS 2002. LNCS, vol. 2513, pp. 342–353. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Hortensius, P.D., McLeod, R.D., Card, H.C.: Parallel random number generation for vlsi systems using cellular automata. IEEE Trans. Computers 38(10), 1466–1473 (1989)

    Article  Google Scholar 

  4. Karmakar, S., Mukhopadhyay, D., Roy Chowdhury, D.: d-Monomial Tests of Nonlinear Cellular Automata for Cryptographic Design. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 261–270. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Markku-juhani, Saarinen, O.: Chosen-iv statistical attacks on estream stream ciphers. In: eSTREAM, ECRYPT Stream Cipher Project, Report 2006/013, pp. 5–19 (2006)

    Google Scholar 

  6. Meier, W., Staffelbach, O.: Analysis of Pseudo Random Sequences Generated by Cellular Automata. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 186–199. Springer, Heidelberg (1991)

    Google Scholar 

  7. NIST Pseudo Random Number Testing Suite, http://csrc.nist.gov/groups/st/toolkit/rng/documentation_software.html

  8. Wolfram, S.: Random sequence generation by cellular automata. Advances in Applied Mathematics 7, 123–169

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, IIT Kharagpur, India

    Kaushik Chakraborty & Dipanwita Roy Chowdhury

Authors
  1. Kaushik Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dipanwita Roy Chowdhury
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Laboratory of Electronics, Democritus University of Thrace, GR 67100, Xanthi, Greece

    Georgios Ch. Sirakoulis

  2. CSAI - Complex Systems and Artificial Intelligence Research Center, University of Milano-Bicocca, 20134, Milano, Italy

    Stefania Bandini

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chakraborty, K., Chowdhury, D.R. (2012). CSHR: Selection of Cryptographically Suitable Hybrid Cellular Automata Rule. In: Sirakoulis, G.C., Bandini, S. (eds) Cellular Automata. ACRI 2012. Lecture Notes in Computer Science, vol 7495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33350-7_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33350-7_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33349-1

  • Online ISBN: 978-3-642-33350-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation