Directed Graph Cryptosystems
Document Type
Oral Presentation
Campus where you would like to present
SURC Room 202
Start Date
15-5-2014
End Date
15-5-2014
Keywords
Cryptography, Graph Theory, Computer Science
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, "Directed Graph Cryptosystems" (2014). Symposium Of University Research and Creative Expression (SOURCE). 16.
https://digitalcommons.cwu.edu/source/2014/oralpresentations/16
Additional Mentoring Department
Mathematics
Directed Graph Cryptosystems
SURC Room 202
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.
Faculty Mentor(s)
Klyve, Dominic