Secure and Computationally-Efficient Cryptographic Primitive based on Cellular Automation
Cryptography and Security
2020-02-25 v1 Computational Complexity
Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.1901.02993,
title = {Secure and Computationally-Efficient Cryptographic Primitive based on Cellular Automation},
author = {Rade Vuckovac},
journal= {arXiv preprint arXiv:1901.02993},
year = {2020}
}