An application of non-uniform cellular automata for efficient cryptography

One of the core issues for robust cryptographic systems is to deal with the rate of diffusion and distribution of keys. We try to strengthen this aspect by increasing the length of block ciphers. We present a new encryption and decryption algorithm for block cipher that supports 27 bit block size. A...

Full description

Saved in:
Bibliographic Details
Published in2013 IEEE Conference on Information and Communication Technologies pp. 1200 - 1205
Main Authors Kumaravel, A., Meetei, Oinam Nickson
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2013
Subjects
Automata
Ciphers
Communications technology
Conferences
Cryptographic system
Encryption
NRCA-Non Reversible CA
Pseudorandom number
RCA-Reversible Cellular Automata
Schedules
Online AccessGet full text
ISBN9781467357593
1467357596
DOI10.1109/CICT.2013.6558283

Cover

More Information
Summary:One of the core issues for robust cryptographic systems is to deal with the rate of diffusion and distribution of keys. We try to strengthen this aspect by increasing the length of block ciphers. We present a new encryption and decryption algorithm for block cipher that supports 27 bit block size. All components in our system are chosen to be based on cellular automata so as to achieve higher parallelism and to simplify the in hardware and software implementation for applications with high degree of security. The main objective of this paper is to increase the complexity by novel schemes of mixing (reversible cellular automata) RCA and (non-uniform reversible cellular automata) NRCA. We apply set of different bit permutation methods for this purpose .This paper establishes the proof for existence of yet another approach for a high quality pseudorandom bit sequences generated by non uniform cellular automata.
ISBN:9781467357593
1467357596
DOI:10.1109/CICT.2013.6558283