d-monomial tests of nonlinear cellular automata for cryptographic design

Authors:
Sandip Karmakar;Debdeep Mukhopadhyay;Dipanwita Roy Chowdhury
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
Venue:
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Year:
2010

Citing 6
Cited 0

Random sequence generation by cellular automata

Advances in Applied Mathematics
Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Comments on "Theory and Applications of Cellular Automata in Cryptography"

IEEE Transactions on Computers
A New Statistical Testing for Symmetric Ciphers and Hash Functions

ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Analysis of pseudo random sequences generated by cellular automata

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A framework for chosen IV statistical analysis of stream ciphers

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology

Quantified Score

Hi-index	0.00

Visualization

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.