Abstract
A perfect hash family PHF(N; k, v, t) is an N × k array on v symbols with v ≥ t, in which in every N × t subarray, at least one row is comprised of distinct symbols. Perfect hash families have a wide range of applications in cryptography, particularly to secure frameproof codes, in database management, and indirectly in software interaction testing. New recursive constructions, new direct constructions, and PHFs found using tabu search are provided here. The first general tables of the best known sizes of PHFs are presented; in the process, the known direct and recursive constructions are surveyed.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 125-150 |
| Number of pages | 26 |
| Journal | Journal of Mathematical Cryptology |
| Volume | 1 |
| Issue number | 2 |
| DOIs | |
| State | Published - Apr 19 2007 |
Keywords
- Interaction testing
- Perfect hash family
- Three-term arithmetic progression
ASJC Scopus subject areas
- Computer Science Applications
- Computational Mathematics
- Applied Mathematics
Fingerprint Dive into the research topics of 'Perfect hash families: Constructions and existence'. Together they form a unique fingerprint.
Cite this
Walker, R. A., & Colbourn, C. (2007). Perfect hash families: Constructions and existence. Journal of Mathematical Cryptology, 1(2), 125-150. https://doi.org/10.1515/JMC.2007.008