Secure and computationally efficient cryptographic primitive based on cellular automaton
From MaRDI portal
Publication:5164101
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.
Recommendations
Cited in
(7)- Designing cryptographically strong \(S\)-boxes with the use of cellular automata
- FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ'S ATTRACTOR
- Cryptographic primitives based on cellular transformations
- On the semantic security of cellular automata based pseudo-random permutation using results from the Luby-Rackoff construction
- scientific article; zbMATH DE number 1186881 (Why is no real title available?)
- scientific article; zbMATH DE number 7385042 (Why is no real title available?)
- CAG
This page was built for publication: Secure and computationally efficient cryptographic primitive based on cellular automaton
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164101)