Theory and applications of cellular automata in cryptography

Author

Nandi, S. ; Kar, B.K. ; Chaudhuri, P. Pal

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Bombay, India

Volume

43

Issue

12

fYear

1994

fDate

12/1/1994 12:00:00 AM

Firstpage

1346

Lastpage

1357

Abstract

This paper deals with the theory and application of Cellular Automata (CA) for a class of block ciphers and stream ciphers. Based on CA state transitions certain fundamental transformations are defined which are block ciphering functions of the proposed enciphering scheme, These fundamental transformations are found to generate the simple (alternating) group of even permutations which in turn is a subgroup of the permutation group, These functions are implemented with a class of programmable cellular automata (PCA) built around rules 51, 153, and 195. Further, high quality pseudorandom pattern generators built around rule 90 and 150 programmable cellular automata with a rule selector (i.e., combining function) has been proposed as running key generators in stream ciphers, Both the schemes provide better security against different types of attacks. With a simple, regular, modular and cascadable structure of CA, hardware implementation of such schemes idealy suit VLSI implementation

Keywords

VLSI; cellular automata; cryptography; random number generation; CA state transitions; VLSI implementation; block ciphers; cellular automata; cryptography; fundamental transformations; programmable cellular automata; pseudorandom pattern generators; stream ciphers; Computer aided instruction; Cryptography; Data privacy; Hardware; Helium; Logic circuits; Logic design; Principal component analysis; Security; Very large scale integration;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.338094

Filename

338094