### Abstract

A known recursive construction for perfect hash families multiplies the number of factors by q, where q is the largest prime power not exceeding the number of symbols. This is generalized to permit multiplication of the number of factors by powers of q; it is also improved upon by restricting the structure of the ingredient designs. For a perfect hash family of strength t, it may be possible to order its rows so that, for each ℓ ≤ t, the first Σ _{i=2} ^{ℓ} N _{i} rows form a perfect hash family of strength ℓ. This 'matroshka' ordering underlies a sometimes substantial reduction in the number of rows generated by the recursive construction. Perfect hash families with useful matroshka orderings are generated using linear orthogonal arrays, and with an effective one-row-at-a-time greedy algorithm.

Original language | English (US) |
---|---|

Pages (from-to) | 291-306 |

Number of pages | 16 |

Journal | Journal of Mathematical Cryptology |

Volume | 3 |

Issue number | 4 |

DOIs | |

State | Published - Dec 1 2009 |

### Keywords

- Distributing hash family
- Orthogonal array
- Perfect hash family

### ASJC Scopus subject areas

- Computer Science Applications
- Computational Mathematics
- Applied Mathematics

## Fingerprint Dive into the research topics of 'A recursive construction for perfect hash families'. Together they form a unique fingerprint.

## Cite this

*Journal of Mathematical Cryptology*,

*3*(4), 291-306. https://doi.org/10.1515/JMC.2009.018