Explicit constructions of perfect hash families from algebraic curves over finite fields

DOI10.1006/jcta.2000.3068zbMath1015.11027OpenAlexW1995096771MaRDI QIDQ5929836

Huaxiong Wang, Xing, Chaoping

Publication date: 5 August 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.2000.3068

zbMATH Keywords

algebraic curves over finite fieldscover-free familiesexplicit constructionsGarcia-Stichtenoth curvesperfect hash family

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (14)

Anonymity in shared symmetric key primitives ⋮ A sequence approach to linear perfect hash families ⋮ Generalised cumulative arrays in secret sharing ⋮ Explicit constructions of separating hash families from algebraic curves over finite fields ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Generalized cover-free families. ⋮ Very large cliques are easy to detect ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ Hierarchical quantum teleportation of arbitrary single-qubit state by using four-qubit cluster state ⋮ On generalized separating hash families ⋮ Geometric constructions of optimal linear perfect hash families ⋮ The combinatorics of generalised cumulative arrays ⋮ Explicit constructions for perfect hash families ⋮ Distributing the encryption and decryption of a block cipher

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• A matrix key-distribution scheme
• Families of finite sets in which no set is covered by the union of \(r\) others
• Explicit construction of exponential sized families of k-independent sets
• Key storage in secure networks
• Optimal linear perfect hash families
• On the asymptotic behaviour of some towers of function fields over finite fields
• Perfect hashing
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• On key storage in secure networks
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Efficient Multiplicative Sharing Schemes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Nonrandom binary superimposed codes

This page was built for publication: Explicit constructions of perfect hash families from algebraic curves over finite fields