JEWLScholar@MTSU Repository

Cellular Automata: Optimal Analysis, Coding, and Testing for Encryption

Show simple item record

dc.contributor.advisor Salman, Karim Faulkenberry, Stephen James 2016-05-13T18:27:16Z 2016-05-13T18:27:16Z 2016-03-16
dc.description.abstract Cellular automata are a set of discrete structures generated and manipulated by predetermined rules, in which each state (or evolution) is influenced by the previous. Utilizing the simplicity of this fundamental structure, a number of configurations have been organized and derived from elementary (single dimensional) cellular automata. By harvesting the evolution of these structures as output, they lend greatly to random number generation and by extension, encryption. Analyzing, testing, and programming these methods has led to observations on optimal approaches to each. Utilizing the Diehard testing suite and the National Institute of Standards and Technology (NIST) Statistical Testing Suite (STS), configurations can be judged against each other as well as external systems. Optimal methods for generating configurations, visual observation and data analysis are compiled in a workbook program. A complete analysis for the state diagrams of k [1, 27] in the 3-bit rule space is included and a Cellular Automata Standard of Encryption (CASE) is suggested for real world use.
dc.publisher Middle Tennessee State University
dc.subject Automata
dc.subject Cellular
dc.subject Encryption
dc.title Cellular Automata: Optimal Analysis, Coding, and Testing for Encryption
dc.type Thesis
dc.contributor.committeemember Sbenaty, Saleh
dc.contributor.committeemember Boles, Walter
dc.thesis.degreelevel Masters
dc.thesis.degreegrantor Middle Tennessee State University
dc.subject.umi Computer science
dc.subject.umi Computer engineering M.S.
dc.contributor.department Engineering Technology en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search JEWLScholar@MTSU


My Account