Secure and Computationally-Efficient Cryptographic Primitive based on Cellular Automation
This addresses security and efficiency challenges in domains like IoT and cyber-physical systems, offering a novel approach to cryptographic primitives.
The paper tackles the need for efficient and secure cryptographic primitives by presenting Mageto, a random number generator based on one-dimensional cellular automaton, which is computationally efficient across hardware and software and inherently resistant to side-channel attacks without extra effort.
Mageto, a random number generator based on one-dimensional cellular automaton (CA) is presented. Three procedures of secure implementation using Mageto is proposed and discussed. Implementations are very efficient in a wide range of hardware and software scenarios. It includes the advanced application of the 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 AES, require additional hardware or software effort to prevent SCA line of attack.