Document Type
Thesis
Date of Degree Completion
Summer 2014
Degree Name
Master of Science (MS)
Department
Computational Science
Committee Chair
Dominic Klyve
Second Committee Member
Filip Jagodzinski
Third Committee Member
Aaron Montgomery
Abstract
Cryptography 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.
Recommended Citation
Boberg, Kurt Anson, "Directed Graph Cryptosystems" (2014). All Master's Theses. 2294.
https://digitalcommons.cwu.edu/etd/2294
Comments
This thesis has been digitized and made available as part of the University’s ongoing preservation and access initiatives. Copyright is retained by the original author. The University has made a good faith effort to review this work for copyright and privacy concerns prior to digitization. If you are the author or a rights holder and have questions, concerns or wish to request removal, please contact ScholarWorks@cwu.edu.