CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
Optimal linear perfect hash families
Journal of Combinatorial Theory Series A
Perfect hash families: probabilistic methods and explicit constructions
Journal of Combinatorial Theory Series A
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Designs, Codes and Cryptography
Roux-type constructions for covering arrays of strengths three and four
Designs, Codes and Cryptography
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
A sequence approach to linear perfect hash families
Designs, Codes and Cryptography
Explicit constructions for perfect hash families
Designs, Codes and Cryptography
Efficient multiplicative sharing schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Geometric constructions of optimal linear perfect hash families
Finite Fields and Their Applications
| Hi-index | 0.00 |
The classical orthogonal arrays over the finite field underlie a powerful construction of perfect hash families. By forbidding certain sets of configurations from arising in these orthogonal arrays, this construction yields previously unknown perfect, separating, and distributing hash families. When the strength s of the orthogonal array, the strength t of the hash family, and the number of its rows are all specified, the forbidden sets of configurations can be determined explicitly. Each forbidden set leads to a set of equations that must simultaneously hold. Hence computational techniques can be used to determine sufficient conditions for a perfect, separating, and distributing hash family to exist. In this paper the forbidden configurations, resulting equations, and existence results are determined when (s, t) 驴 {(2, 5), (2, 6), (3, 4), (4, 3)}. Applications to the existence of covering arrays of strength at most six are presented.