Cellular Automata: An Ideal Candidate for a Block Cipher

The given paper is devoted to the software development of block cipher based on reversible one-dimensional cellular automata and the study of its statistical properties. The software implementation of the proposed encryption algorithm is performed in C# programming language in Visual Studio 2017. The paper presents specially designed approach for key generation. To ensure desired cryptographic stability, the shared secret parameters can be adjusted to contain information needed for creating substitution tables, defining reversible rules, and hiding final data. For the first time, it is suggested to create substitution tables based on iterations of a cellular automaton that is initialized by the key data.

Download Full-text

On the semantic security of cellular automata based pseudo-random permutation using results from the Luby-Rackoff construction

Annales Universitatis Mariae Curie-Sklodowska sectio AI – Informatica ◽

10.17951/ai.2015.15.1.21-31 ◽

2015 ◽

Vol 15 (1) ◽

pp. 21

Author(s):

Kamel Mohammed Faraoun

Keyword(s):

Cellular Automata ◽

Block Cipher ◽

Random Permutation ◽

Block Ciphers ◽

Random Permutations ◽

Semantic Security ◽

Transition Rules ◽

Reversible Cellular Automata ◽

Symmetric Block ◽

Number Of Iterations

This paper proposes a semantically secure construction of pseudo-random permutations using second-order reversible cellular automata. We show that the proposed construction is equivalent to the Luby-Rackoff model if it is built using non-uniform transition rules, and we prove that the construction is strongly secure if an adequate number of iterations is performed. Moreover, a corresponding symmetric block cipher is constructed and analysed experimentally in comparison with popular ciphers. Obtained results approve robustness and efficacy of the construction, while achieved performances overcome those of some existing block ciphers.

Download Full-text

Opto-Electronic Block-Cipher Based on Iteration of the 2-D Toggle Cellular Automata: Algorithm

Optical Review ◽

10.1007/s10043-999-0110-8 ◽

1999 ◽

Vol 6 (2) ◽

pp. 110-117 ◽

Cited By ~ 2

Author(s):

Maria Madjarova ◽

Mitsugu Kakuta ◽

Takashi Obi ◽

Masahiro Yamaguchi ◽

Nagaaki Ohyama

Keyword(s):

Cellular Automata ◽

Block Cipher ◽

Cellular Automata Algorithm

Download Full-text

Applications of Two Dimensional Cellular Automata rules for Block Cipher in Cryptography

International Journal of Computer and Communication Technology ◽

10.47893/ijcct.2012.1124 ◽

2012 ◽

pp. 111-117

Author(s):

Sambhu Prasad Panda ◽

Madhusmita Sahu ◽

Manas Kumar Swain

Keyword(s):

Cellular Automata ◽

Block Cipher ◽

Substitution Box ◽

Plain Text ◽

Cipher Text ◽

Xor Operation ◽

Encryption And Decryption ◽

A Cell ◽

Updating Rule ◽

Fundamental Objective

Cellular Automaton is an idealized parallel processing machine which is an array (1-D, 2-D) of numbers or symbols called cell values together with an updating rule. A cell value is updated based on this updating rule, which involves the cell value as well as other cell values in a particular neighborhood. A fundamental objective of cryptography is to enable two people to communicate over an insecure channel (a public channel such as internet) in such a way that any other person is unable to recover their message (called the plaintext) from what is sent in its place over the channel (the cipher text). The transformation of the plaintext into the cipher text is called encryption, or enciphering. The transformation of the cipher text into the plaintext is called decryption, or deciphering. In this paper we present a new encryption and decryption algorithm based on the linear (periodic boundary-PB) and nonlinear Cellular Automata rules. First we apply PB CA rules to plain text and key. The result of both plain text and key is XORed. Then the result of XOR operation is fed to substitution box( S-box) and again PB CA rules are applied for exchange and shift operations. At the end Complement operation is applied for encryption of plain text. The decryption process is carried out just similar to encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 numbers of rounds in order to avoid the dependency between the plain text and cipher text.

Download Full-text

Encryption and Decryption algorithm using two dimensional cellular automata rules in Cryptography

International Journal of Communication Networks and Security ◽

10.47893/ijcns.2011.1003 ◽

2011 ◽

pp. 18-23

Author(s):

Sambhu Prasad Panda ◽

Madhusmita Sahu ◽

Umesh Prasad Rout ◽

Surendra Kumar Nanda

Keyword(s):

Cellular Automata ◽

Periodic Boundary ◽

Block Cipher ◽

Two Dimensional ◽

Substitution Box ◽

Plain Text ◽

Cipher Text ◽

Xor Operation ◽

Encryption And Decryption ◽

Non Linear

In this paper we present a new encryption and decryption algorithm for block cipher based on the linear (periodic boundary-PB) and nonlinear cellular automata rules. First we apply non linear CA rules (complements) to both plain text and key. Then PB CA rule is applied to the above results separately followed by the XOR operation of above results. After that the result of XOR operation is fed to substitution box(S-box) and again PB CA rules are applied followed by SBox. The decryption process is carried out just similar to that of encryption but in the reverse way. Both the process of encryption and decryption is performed for 8 number of rounds in order to avoid the dependency between the plain text and cipher text so that the our proposed algorithm is more secure than that of AES and DES algorithms.

Download Full-text

A New Block Cipher System Using Cellular Automata and Ant Colony Optimization (BC-CaACO)

International Journal of Information Security and Privacy ◽

10.4018/ijisp.2018100104 ◽

2018 ◽

Vol 12 (4) ◽

pp. 54-67

Author(s):

Charifa Hanin ◽

Fouzia Omary ◽

Souad Elbernoussi ◽

Khadija Achkoun ◽

Bouchra Echandouri

Keyword(s):

Information Security ◽

Cellular Automata ◽

Ant Colony Optimization ◽

Private Information ◽

Block Cipher ◽

Ant Colony ◽

One Dimensional ◽

Information Confidentiality ◽

And Diffusion ◽

Confusion And Diffusion

The communication of private information is very dangerous, since unauthorized entities can intercept it. Thus, encryption is one of the principal information security solutions that helps keep information confidentiality. This latter can be satisfied by the use of various encryption techniques, namely block cipher. In this paper, the authors propose a novel block cipher using reversible and irreversible one-dimensional cellular automata (CA) with an ant colony optimization (ACO)-based S-box in order to establish more confusion. The obtained experimental results confirm that the designed cipher resists against statistical attacks, and it has both good confusion and diffusion comparing to the existent classical symmetric cryptosystems.

Download Full-text