Optimum Cellular Automata Configurations for Encryption

dc.contributor.advisor Salman, Karim en_US
dc.contributor.author Nichols, Daniel en_US
dc.contributor.committeemember Boles, Walter en_US
dc.contributor.committeemember Sbenaty, Saleh en_US
dc.contributor.department Engineering Technology en_US
dc.date.accessioned 2015-08-25T14:18:57Z
dc.date.available 2015-08-25T14:18:57Z
dc.date.issued 2015-04-14 en_US
dc.description.abstract Elementary cellular automata (ECA) is using Boolean logic functions to generate populations of ones and zeros. Population takes place temporally; each row of bits are populated based on the data from the previous row. The rules followed for generation of the next row are the functions mentioned above. Some rules produce very linear and predictable sets of binary data whereas some of them are chaotic in nature, like rule 30, and can be used to produce pseudo-random populations. This state by state calculation is ideal for cryptography in that it relies on an initial state (password or key) and can be streamed or generated as more data is transferred; the patterns are also largely unknown and are not predictable or linear in some cases. Currently, research shows many promising configurations of population generation that can be used for securing digital data or communications. Unfortunately the chaotic rules tend to repeat themselves after a given amount of temporal generation. This cyclic behavior is non-linear and near impossible to detect without generating the ECA. This research is aimed at finding the relationships between row length and cycle length in an effort to make a given key more effective by lengthening or eliminating this repetitious behavior. en_US
dc.description.degree M.S. en_US
dc.identifier.uri http://jewlscholar.mtsu.edu/handle/mtsu/4527
dc.publisher Middle Tennessee State University en_US
dc.subject AES en_US
dc.subject Automata en_US
dc.subject Automation en_US
dc.subject Cellular en_US
dc.subject Encryption en_US
dc.subject Security en_US
dc.subject.umi Computer science en_US
dc.subject.umi Computer engineering en_US
dc.thesis.degreegrantor Middle Tennessee State University en_US
dc.thesis.degreelevel Masters en_US
dc.title Optimum Cellular Automata Configurations for Encryption en_US
dc.type Thesis en_US
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
5.97 MB
Adobe Portable Document Format