d-Monomial Tests of Nonlinear Cellular Automata for Cryptographic Design

  • Sandip Karmakar
  • Debdeep Mukhopadhyay
  • Dipanwita Roy Chowdhury
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6350)

Abstract

Pseudorandom generation is a key to any cryptographic application. Linear Cellular Automata are known as good pseudorandom generators. However, for cryptographic applications nonlinearity is essential for its security. But, nonlinear Cellular Automaton shows high correlation between the input to the automaton and its generated sequence. Hence, for cryptography Cellular Automata rules need to be nonlinear as well as satisfy additional properties. With this motivation, in this paper, we analyze nonlinear Cellular Automata with a newly developed statistical measure called d-monomial test. Finally, we propose a process of d-monomial characteristics addition to get cryptographically suitable Cellular Automata.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Filiol, E.: 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)CrossRefGoogle Scholar
  2. 2.
    Johansson, T., Englund, H., Turan, M.S.: A framework for chosen iv statistical analysis of stream ciphers. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 268–281. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Juhani, M., Saarinen, O.: Chosen-iv statistical attacks on e-stream stream ciphers. eSTREAM, ECRYPT Stream Cipher Project, Report 2006/013, pp. 5–19 (2006)Google Scholar
  4. 4.
    Murphy, S., Paterson, K.G., Blackburn, S.R.: Theory and applications of cellular automata in cryptography. IEEE Transactions on Computers 46(5) (1997)Google Scholar
  5. 5.
    Koc, C.K., Apohan, A.M.: Inversion of cellular automata iterations. IEE Proceedings of Computers and Digital Techniques 144(5), 279–284 (1997)CrossRefGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 7.
    Martin, B., Sole, P.: Pseudo-random sequences generated by cellular automata. In: International Conference on Relations, Orders and Graphs: Interactions with Computer Science (2008)Google Scholar
  8. 8.
    Martin, B., Sole, P., Lacharme, P.: Pseudo-random sequences, boolean functions and cellular automata. Boolean Functions: Cryptography and Applications (2007)Google Scholar
  9. 9.
    Roy Chowdhury, D., Nandi, S., Chattopadhyay, S., Pal Chaudhuri, P.: Ca and its applications: A brief survey. Additive Cellular Automata - Theory and Applications (1997)Google Scholar
  10. 10.
    Wolfram, S.: Cryptography with cellular automata. CRYPTO: Proceedings of Crypto (1985)Google Scholar
  11. 11.
    Wolfram, S.: Random sequence generation by cellular automata. Advances in Applied Mathematics 7, 123–169 (1986)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Sandip Karmakar
    • 1
  • Debdeep Mukhopadhyay
    • 1
  • Dipanwita Roy Chowdhury
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyKharagpurIndia

Personalised recommendations