Genetic algorithm stream cipher key generation using NIST functions / by Hunter W. Leggett.
| Author/creator | Leggett, Hunter W. author. |
| Other author | Chou, Te-Shun, 1964- degree supervisor. |
| Other author | East Carolina University. Department of Technology Systems. |
| Format | Theses and dissertations |
| Publication | [Greenville, N.C.] : [East Carolina University], 2022. |
| Description | 1 online resource (106 pages) : illustrations (some color) |
| Supplemental Content | Access via ScholarShip |
| Subjects |
| Summary | Stream ciphers are beneficial because of their efficiency, speed, and low resource utilization. However, stream ciphers are vulnerable to many attacks if they do not use strong keys for encryption and decryption. Thus, one way to increase the security of stream ciphers is to improve the key generation algorithm. This study sought to evaluate the keys produced by a genetic algorithm stream cipher when individual and combinations of fitness functions are used. Furthermore, this study identified which fitness function is the best for a specific scenario. For the genetic algorithm, the fitness tests are thirteen of the tests defined in NIST SP 800-22rla. The thirteen different fitness functions were inputted into the genetic algorithm stream cipher one at a time. Next, 50 total keys of varying bit sizes were generated. These keys were evaluated by using the Hamming distance between the keys and time that it took for key generation. After each individual fitness function was evaluated, two combinations of five tests were created and used as a single fitness function. The two combinations were the best performing NIST functions for Hamming distance and time for 256-bit keys. Sensitivity analysis was then performed to find the best possible combination of the NIST functions. Based on the results, using different individual functions or a combination of functions as a fitness functions changed the Hamming distance between the keys and the time that it takes to generate a key. Furthermore, using sensitivity analysis results for the top two, three, four, and five combinations for Hamming distance and time, prediction equations were created and used to predict values for other combinations and key sizes. |
| General note | Presented to the Faculty of the Department of Technology Systems |
| General note | Advisor: Te-Shun Chou |
| General note | Title from PDF t.p. (viewed May 2, 2024). |
| Dissertation note | M.S. East Carolina University 2022. |
| Bibliography note | Includes bibliographical references. |
| Technical details | System requirements: Adobe Reader. |
| Technical details | Mode of access: World Wide Web. |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | Access Content Online | ✔ Available |