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

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

Charifa Hanin, Fouzia Omary, Souad Elbernoussi, Khadija Achkoun, Bouchra Echandouri
Copyright: © 2018 |Pages: 14
DOI: 10.4018/IJISP.2018100104
(Individual Articles)
No Current Special Offers


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.
Article Preview


The communication via network of private data could be subject to alteration by malicious entities. In order to ensure confidentiality, authentication, integrity and non-repudiation it is important to implement robust cryptosystems to protect data. Hence, cryptography is a mechanism that ensures data security. Being the science of secret, it has the aim to protect message transmission. In literature, there exists namely asymmetric and symmetric cryptosystems. The asymmetric or public key cryptosystems use a public key for encryption and secrete key for decryption. The symmetric or secrete key cryptosystems use the same key to both encryption and decryption (Smart, 2016a). Hence, Symmetric cryptosystems are namely block ciphers and stream ciphers. A block cipher split the message into fixed length blocks including the secrete key. A stream cipher encrypts bit by bit in real-time.

In our work, we propose a block cipher to provide messages’ confidentiality. This latter is ensured once the information can be intelligible only by the authorized entities. Generally, to ensure confidentiality, encryption mechanisms are used. Thus, the researchers focus on designing systems maximally resistant to the various attacks. Accordingly, we propose a novel block cipher named BC-CaACO that uses in its process cellular automata (CA) and an S-box based on chaos and ant colony optimization (ACO) (Ahmad et al., 2015).

Cellular automata (CA) are dynamic systems that are used to design numerous cryptosystems due to their properties such as homogeneity, locality, parallelism, simplicity and unpredictability (Wolfram, 2002). Additionally, it facilitates the hardware and software implementations (Shin et al., 2012). A block cipher is considered to be secure if the used both S-Boxes and keys satisfy both the security criterions. ACO based optimized S-Box (Ahmad et al., 2015) is an efficient S-Box that provides a high nonlinearity and other S-Boxes’ properties.

Hence, the computational results prove that our proposed design resists against statistical attacks. Further, the obtained experimental results confirm that the designed cipher has both good confusion and diffusion comparing to the existent well-known iterative block ciphers.

The paper is structured as follows: Section 2 covers the basic notions about cellular automata, substitution boxes and ant colony optimization algorithm. Thereafter, some related works are cited. Section 3 shows the description of the proposed block cipher. Afterwards, the security analysis and experimental results are showed in section 4. Finally, in section 5, the conclusion and future works are presented.

Complete Article List

Search this Journal:
Volume 18: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 17: 1 Issue (2023)
Volume 16: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing