Indian Journal of Science and Technology
DOI: 10.17485/ijst/2013/v6isp5.10
Year: 2013, Volume: 6, Issue: Supplementary 5, Pages: 1-7
Original Article
A. Kumaravel1* and Oinam Nickson Meetei2
1 Dean & Professor,Department of Computer Science & Engineering Bharath University, [email protected]
2 PG Scholar, Department of Computer Science & Engineering Bharath University, Chennai; [email protected]
*Author For Correspondence
A. Kumaravel
Department of Computer Science & Engineering Bharath University,
Email:[email protected]
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.
Keywords: Cryptographic System, NRCA-non Reversible CA, Pseudorandom Number, RCA-Reversible Cellular Automata.
Subscribe now for latest articles and news.
