Abstract

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.

Highlights

  • Two main cryptography systems are used today: symmetric systems and public-key systems

  • The encryption process is based on generation of pseudorandom bit sequences, and Cellular Automata (CA) can be effectively used for this purpose

  • One-dimensional cellular automata encryption algorithm called as Lightweight Cellular Automata-based Symmetrickey Encryption (LCASE) is described in [2]

Read more

Summary

Introduction

Two main cryptography systems are used today: symmetric systems (aka secret key systems) and public-key systems. The main concern of this paper is secret key systems In such systems the encryption key and the decryption key are same (symmetric key). Encryption, by theory requires highly complex actions such as permuting, flipping and altering data in such a way that it is undecipherable and provides complex relationship with the original text and the keys. This relationship should be non-linear so that decryption is as tough as possible. Further as stated by Wolfram [4, 5], Rule 30 promotes the use of large integers in the pseudo random number generation. We discuss the terminology used in the paper for easier reading

Lightweight Cellular Automata Symmetric-key Encryption
Next State Generation by Various Ca Rules
RCA Key Schedule
Non-Uniform Reversible Cellular Automata
Main algorithm
Decryption
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call