Linear Hybrid Cellular Automata (LHCA) Rule 90/150 Based S-Box
Muhammad Fahim Roslan1, Kamaruzzaman Seman2, Azni Haslizan Ab Halim3, M Nor Azizi Md Sayuti4

1Muhammad Fahim Roslan, Universiti Sains Islam Malaysia.

2Kamaruzzaman Seman, University Sains Islam Malaysia.

3Azni Haslizan Ab Halim, University Sains Islam Malaysia.

4M Nor Azizi Md Sayuti, University Sains Islam Malaysia.

Manuscript received on 04 May 2019 | Revised Manuscript received on 09 May 2019 | Manuscript Published on 13 May 2019 | PP: 267-274 | Volume-8 Issue-7S May 2019 | Retrieval Number: G10490587S19/19©BEIESP

Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (

Abstract: Most modern block cipher today comprises of single nonlinear element which is called as substitution box. It comes with various of size depending on the cipher input and the secret key. Various methods have been proposed in order to construct it. In this paper, a new construction method has been proposed that is based on linear hybrid cellular automata (LHCA) iteration. There are specific number of combinations of rule 150 and rule 90 of elementary cellular automata (ECA) with two states and three neighborhoods that generate maximum cycle sequence which usually adapted as pseudo random number generator. However, the sequence is actually the permutation of finite elements which is suitable for the S-Box construction. Within this paper context, we manipulate the sequence by varying the initial condition to produce about 8192 different S-Box with different security level from 32 different rule combination. The maximum nonlinearity that we could achieve is 108 with differential uniformity value of 8.

Keywords: Block Cipher, Cellular Automata, Cryptography , Primitive Polynomial.
Scope of the Article: Emulation and Simulation Methodologies for IoT