Cellular Automata : An Ideal Candidate for a Block Cipher

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.

[1]  Debdeep Mukhopadhyay,et al.  An efficient end to end design of Rijndael cryptosystem in 0.18 /spl mu/ CMOS , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[2]  Kenneth G. Paterson,et al.  Comments on "Theory and Applications of Cellular Automata in Cryptography" , 1997, IEEE Trans. Computers.

[3]  Parimal Pal Chaudhuri,et al.  Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.

[4]  Debdeep Mukhopadhyay,et al.  Characterization of a Class of Complemented Group Cellular Automata , 2004, ACRI.

[5]  Ph. Tsalides.  Cellular automata-based built-in self-test structures for VLSI systems , 1990 .

[6]  Debdeep Mukhopadhyay,et al.  Design and Analysis of a Robust and Efficient Block Cipher using Cellular Automata , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[7]  Debdeep Mukhopadhyay,et al.  Computer aided test (CAT) tool for mixed signal SOCs , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[8]  Debdeep Mukhopadhyay,et al.  Cellular automata based key agreement , 2005, ICETE.

[9]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[10]  Debdeep Mukhopadhyay,et al.  Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography , 2006, ACRI.

[11]  A. Thanailakis,et al.  Pseudorandom number generators for VLSI systems based on linear cellular automata , 1991 .

[12]  Debdeep Mukhopadhyay,et al.  CryptoScan: A Secured Scan Chain Architecture , 2005, 14th Asian Test Symposium (ATS'05).

[13]  Moni Naor,et al.  Constructing Pseudo-Random Permutations with a Prescribed Structure , 2001, SODA '01.

[14]  Ricardo Reis,et al.  Physical Design Automation , 2006 .

[15]  Howard C. Card,et al.  Cellular automata-based pseudorandom number generators for built-in self-test , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[16]  S. Banerjee,et al.  Best repair: an efficient reconfiguration for RRAM , 2004, Proceedings of the IEEE INDICON 2004. First India Annual Conference, 2004..

[17]  Debdeep Mukhopadhyay,et al.  A Cellular Automata Based Approach for Generation of Large Primitive Polynomial and Its Application to RS-Coded MPSK Modulation , 2006, ACRI.

[18]  S. Banerjee,et al.  Automatic generated built-in-self-test for embedded memory , 2004, Proceedings of the IEEE INDICON 2004. First India Annual Conference, 2004..

[19]  Debdeep Mukhopadhyay,et al.  CCMEA: Customized Cellular Message Encryption Algorithm for Wireless Networks , 2005, ICISS.

[20]  Debdeep Mukhopadhyay,et al.  Reformatting test patterns for testing embedded core based system using test access mechanism (TAM) switch [SoC] , 2002, Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conference on VLSI Design.