Secure and Computationally Efficient Cryptographic Primitive Based on Cellular Automaton

Loading...
Thumbnail Image
File version

Version of Record (VoR)

Author(s)
Vuckovac, Rade
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2019
Size
File type(s)
Location
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.

Journal Title

Complex Systems

Conference Title
Book Title
Edition
Volume

28

Issue

4

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© The Author(s) 2019. This is an Open Access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence

Cognitive and computational psychology

Science & Technology

Physical Sciences

Mathematics, Interdisciplinary Applications

Mathematics

cellular automata

Persistent link to this record
Citation

Vuckovac, R, Secure and Computationally Efficient Cryptographic Primitive Based on Cellular Automaton, Complex Systems, 2019, 28 (4), pp. 457-474

Collections