4-Bit Cellular Automata Encryption Analysis

No Thumbnail Available
Date
2017-07-13
Authors
Leitner, Dallas
Journal Title
Journal ISSN
Volume Title
Publisher
Middle Tennessee State University
Abstract
Forms of cellular automata have been used for decades in various niches. One such use is random number generation for data encryption. There are numerous ways that have been developed for this purpose, but they are largely centered on the use of the 3-bit rule space. While this rule space has been tested and proven to possess the desired traits, limiting CA to only the 3-bit rule space severely limits the potential for extreme levels of complexity. To that end, this research aims to explore the 4-bit rule space to find new potential rules that possess the desired level of complexity with the hope that the methods used can be applied to still greater rule spaces.
Description
Keywords
4-bit, Cellular Autamta, ECA, Encryption
Citation
Collections