FURI | Spring 2018

Efficient Hash Family Creation and Implementation

The goal of this research project is to create the largest Perfect Hash Families (PHF) possible in the most efficient manner while simultaneously maximizing the efficiency of the system in which they are being implemented. A PHF is an array in which any selection of t-columns, the degree of separation, will always contain at least one row in which all of the t-values are unique. Such arrays are extremely valuable in the realm of cybersecurity and computer networking. Current work covers the efficient generation of PHFs, and future work will involve efficiently repairing arrays that are almost PHFs.