Comments on "Theory and applications of cellular automata in cryptography" [with reply]
Simon R. Blackburn⋆, Sean Patrick Murphy, Kenneth G. Paterson, Sukumar Nandi, P.P. Chaudhuri · IEEE Transactions on Computers · 1997
This paper argues that the cipher systems based on cellular automata (CA) proposed by S. Nandi et al. (1994) are affine and are insecure. A reply by S. Nandi and P. Pal Chaudhuri is given. The reply emphasizes the point that the regular, modular, cascadable structure of local neighborhood CA can be employed for building low cost cipher system hardware. This cost effective engineering solution can achieve desired level of security with larger size CA.