Chapter

Cellular Automata

Volume 6350 of the series Lecture Notes in Computer Science pp 261-270

d-Monomial Tests of Nonlinear Cellular Automata for Cryptographic Design

  • Sandip KarmakarAffiliated withDepartment of Computer Science and Engineering, Indian Institute of Technology
  • , Debdeep MukhopadhyayAffiliated withDepartment of Computer Science and Engineering, Indian Institute of Technology
  • , Dipanwita Roy ChowdhuryAffiliated withDepartment of Computer Science and Engineering, Indian Institute of Technology

* Final gross prices may vary according to local VAT.

Get Access

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.