Perfect hash families of strength three with three rows from varieties on finite projective geometries

DOI10.1007/s10623-015-0052-zzbMath1323.05022OpenAlexW2061572350MaRDI QIDQ887417

Ryoh Fuji-Hara

Publication date: 26 October 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-015-0052-z

zbMATH Keywords

perfect hash familyvarietyfinite projective geometry

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of finite geometries (05B25) Finite geometry and special incidence structures (51E99)

Related Items

Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Some intriguing upper bounds for separating hash families ⋮ Fractal perfect hash families (extended abstract) ⋮ Constructions and bounds for separating hash families ⋮ Distributing hash families with few rows

Cites Work

• Roux-type constructions for covering arrays of strengths three and four
• Efficient Multiplicative Sharing Schemes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Perfect Hash Families: Constructions and Existence
• Maximal partial ovoids and maximal partial spreads in hermitian generalized quadrangles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item