4-Bit Cellular Automata Encryption Analysis

dc.contributor.advisorSalman, Karim
dc.contributor.authorLeitner, Dallas
dc.contributor.committeememberBoles, Walter
dc.contributor.committeememberSbenaty, Saleh
dc.contributor.departmentEngineering Technologyen_US
dc.date.accessioned2017-10-04T20:15:31Z
dc.date.available2017-10-04T20:15:31Z
dc.date.issued2017-07-13
dc.description.abstractForms 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.
dc.description.degreeM.S.
dc.identifier.urihttp://jewlscholar.mtsu.edu/xmlui/handle/mtsu/5435
dc.publisherMiddle Tennessee State University
dc.subject4-bit
dc.subjectCellular Autamta
dc.subjectECA
dc.subjectEncryption
dc.subject.umiComputer engineering
dc.subject.umiComputer science
dc.thesis.degreegrantorMiddle Tennessee State University
dc.thesis.degreelevelMasters
dc.title4-Bit Cellular Automata Encryption Analysis
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Leitner_mtsu_0170N_10861.pdf
Size:
735.55 KB
Format:
Adobe Portable Document Format

Collections