This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reply to Comments on "Theory and Application of Cellular Automata in Cryptography"
May 1997 (vol. 46 no. 5)
pp. 639

Abstract—This 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.

[1] S.R. Blackburn, S. Murphy, and K.G. Paterson, "Comment on 'Theory and Application of Cellular Automata in Cryptography,'" IEEE Trans. Computers, vol. 46, no., pp., 1997.
[2] S. Nandi, B.K. Kar, and P. Pal Chaudhuri, "Theory and Application of Cellular Automata in Cryptography," IEEE Trans. Computers, vol. 43, no. 12, pp. 1,346-1,357, Dec. 1994.

Index Terms:
Cellular automata (CA), programmable CA (PCA), cipher system, cryptoanalysis, affine transform, PCA generator.
Citation:
S. Nandi, P. Pal Chaudhuri, "Reply to Comments on "Theory and Application of Cellular Automata in Cryptography"," IEEE Transactions on Computers, vol. 46, no. 5, pp. 639, May 1997, doi:10.1109/TC.1997.589246
Usage of this product signifies your acceptance of the Terms of Use.