Geometric constructions of optimal linear perfect hash families

S. G.  Barwick; W. -A.  Jackson.

Paper 2006/002

Geometric constructions of optimal linear perfect hash families

S. G. Barwick and W. -A. Jackson.

Abstract

A linear $(q^{d}, q, t)$ -perfect hash family of size $s$ in a vector space $V$ of order $q^{d}$ over a field $F$ of order $q$ consists of a sequence $ϕ_{1}, \dots, ϕ_{s}$ of linear functions from $V$ to $F$ with the following property: for all $t$ subsets $X \subseteq V$ there exists $i \in {1, \dots, s}$ such that $ϕ_{i}$ is injective when restricted to . A linear -perfect hash family of minimal size is said to be optimal. In this paper we use projective geometry techniques to completely determine the values of for which optimal linear -perfect hash families exist and give constructions in these cases. We also give constructions of optimal linear -perfect hash families.

Metadata

Available format(s): PDF
Category: Applications
Publication info: Published elsewhere. Unknown where it was published
Keywords: perfect hash families
Contact author(s): sue barwick @ adelaide edu au
History: 2006-01-04: received
Short URL: https://ia.cr/2006/002
License: CC BY

BibTeX

@misc{cryptoeprint:2006/002,
      author = {S. G.  Barwick and W. -A.  Jackson.},
      title = {Geometric constructions of optimal linear perfect hash families},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/002},
      year = {2006},
      url = {https://eprint.iacr.org/2006/002}
}