Fast and compact minimal perfect hash functions in C++.
-
Updated
Jun 23, 2024 - C++
Fast and compact minimal perfect hash functions in C++.
This is my coursework for the second semester of the first year in KPI , in which I implemented the search for given elements in the array
Sparkle, Schwaemm and Esch: Lightweight Symmetric Cryptography for the Internet of Things
This project uses a hash table with quadratic probing to store individual strands of DNA. Once the hash table reaches its capacity, all the data is copied into a new table with a capacity four times greater than the previous one.
Add a description, image, and links to the hash-function topic page so that developers can more easily learn about it.
To associate your repository with the hash-function topic, visit your repo's landing page and select "manage topics."