4-Bit Cellular Automata Encryption Analysis
4-Bit Cellular Automata Encryption Analysis
dc.contributor.advisor | Salman, Karim | |
dc.contributor.author | Leitner, Dallas | |
dc.contributor.committeemember | Boles, Walter | |
dc.contributor.committeemember | Sbenaty, Saleh | |
dc.contributor.department | Engineering Technology | en_US |
dc.date.accessioned | 2017-10-04T20:13:35Z | |
dc.date.available | 2017-10-04T20:13:35Z | |
dc.date.issued | 2017-07-13 | |
dc.description.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. | |
dc.description.degree | M.S. | |
dc.identifier.uri | http://jewlscholar.mtsu.edu/xmlui/handle/mtsu/5404 | |
dc.publisher | Middle Tennessee State University | |
dc.subject | 4-bit | |
dc.subject | Cellular Autamta | |
dc.subject | ECA | |
dc.subject | Encryption | |
dc.subject.umi | Computer engineering | |
dc.subject.umi | Computer science | |
dc.thesis.degreegrantor | Middle Tennessee State University | |
dc.thesis.degreelevel | Masters | |
dc.title | 4-Bit Cellular Automata Encryption Analysis | |
dc.type | Thesis |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- Leitner_mtsu_0170N_10861.pdf
- Size:
- 735.55 KB
- Format:
- Adobe Portable Document Format
- Description: