Cellular automata: an ideal candidate for a block cipher

Authors:
Debdeep Mukhopadhyay;Dipanwita RoyChowdhury
Affiliations:
Indian Institute of Technology, Kharagpur, India;Indian Institute of Technology, Kharagpur, India
Venue:
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Year:
2004

Citing 2
Cited 0

Theory and Applications of Cellular Automata in Cryptography

IEEE Transactions on Computers
Comments on "Theory and Applications of Cellular Automata in Cryptography"

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Confusion and diffusion are two important requirements of the round of a block cipher In the present paper Cellular Automata (CA) has been identified as a mathematical tool to achieve these The analytical framework of the automata has been used to characterize a new class of linear CA and to implement the non-linearity through a non-linear reversible CA A generalized ideal structure of the block cipher round have been developed and has been shown to perform both encryption and decryption.