Title

Directed Graph Cryptosystems

Presenter Information

Kurt Boberg

Document Type

Oral Presentation

Location

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.

Faculty Mentor(s)

Klyve, Dominic

Additional Mentoring Department

Mathematics

This document is currently not available here.

Share

COinS
 
May 15th, 9:10 AM May 15th, 9:30 AM

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.