DocumentCode
1557409
Title
Comments on "Theory and applications of cellular automata in cryptography" [with reply]
Author
Blackburn, S.R. ; Murphy, Sinead ; Paterson, K.G. ; Nandi, Sukumar ; Chaudhuri, P.P.
Author_Institution
Inf. Security Group, London Univ., UK
Volume
46
Issue
5
fYear
1997
fDate
5/1/1997 12:00:00 AM
Firstpage
637
Lastpage
639
Abstract
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.
Keywords
cellular automata; computational complexity; cryptography; cascadable structure; cellular automata; cipher systems; cryptography; local neighborhood; Clocks; Cryptography; Interleaved codes; Polynomials; Principal component analysis; Read only memory; Security;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.589245
Filename
589245
Link To Document