This project features a paper and a demo. The concept is that lots of data that is collected and stored is quite small. For example, names, credit card numbers, addresses, ip, certain logs, transaction statements. Algorithms that are deployed today sometimgs need to add padding for the algorithm to run due to a minumum block size. The goal was to build an algorithm that encrpyts data and outputs the exact same size, while also being fast enough for every piece of data to be encrypted individually. In the end, the algorithm was found to reach speeds faster then widely used algortihms at very low data count. The number of keys created would also grow linearly with the data, 2-3x the amount of storage needed. Overall this was a nice introduction to research and has made me interested in pursuing the masters.
Digraph DatabaseThis short paper looks at a database application that could be used for a variety of applications. It focuses on a digraph structure to link data together. It was used within the Neoko Music storage system, but could be expanded to different areas. Some other use cases that may be useful to look into are legal documents and organization, and business needs for documents that involve multiple versions.