Secure and Computationally Efficient Cryptographic Primitive Based on Cellular Automaton
Rade Vuckovac
School of Information and Communication Technology
Griffith University
Parklands Drive
Southport, QLD 4222, Australia
Abstract
The cellular automaton generator (CAG), a random number generator based on the one-dimensional cellular automaton (CA), is presented. Three procedures of secure implementation using the CAG are proposed and discussed. Implementations are very efficient in a wide range of hardware and software scenarios. That includes the advanced application of internet of things (IoT) and cyber-physical systems, which are both needed for computationally efficient cryptographic primitives. Furthermore, the proposed primitive is inherently resistant against the side-channel attack (SCA), where many currently available ciphers, such as the advanced encryption standard (AES), require additional hardware or software effort to prevent the SCA line of attack.
Keywords: cellular automata; cryptographic primitive; side-channel attack; stream cipher performance
Cite this publication as:
R. Vuckovac, “Secure and Computationally Efficient Cryptographic Primitive Based on Cellular Automaton,” Complex Systems, 28(4), 2019 pp. 457–474.
https://doi.org/10.25088/ComplexSystems.28.4.457
