Abstract
dc:description.abstractCryptography is a necessary tool for secrecy in our increasingly connected and data-driven world. As advances are made in both mathematics and computer hardware design, existing cryptosystems must be improved or replaced to maintain privacy of sensitive data. In this paper we propose a novel cryptosystem based upon an algorithmic traversal of a directed graph (digraph). The system is resistant to the most common attacks on stream-type ciphers that do not use known-plaintext attacks. However, given a length n, the minimum number of vertices a digraph must contain to guarantee a cycle of at least n length is unknown, making the system unsuitable for practical use without further research.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Discipline thesis:degree_discipline
- Computational Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Boberg, Kurt Anson
- Contributors dc:contributor
-
- Dominic Klyve
- Filip Jagodzinski
- Aaron Montgomery
Subjects
dc:subject × 5Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.cwu.edu/etd/2294