scientific article; zbMATH DE number 1759800

MaRDI QIDQ4536823zbMATH OpenFDO

Authors Holger Schellwat, Jürgen Bierbrauer

Publication date 28 July 2002

zbMATH Keywords

almost independent arraysauthenticationexponential sum methodFourier transformhashingHermitian codeslow biasReed-Solomon codesresiliencySuzuki codesWeil-Carlitz-Uchiyama boundZyablov bound

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Recommendations

• Weakly biased arrays, almost independent arrays and error-correcting codes
• Universal hashing and authentication codes
• Almost \(k\)-wise independent sample spaces and their cryptologic applications
• Universal hash functions from exponential sums over finite fields and Galois rings
• scientific article; zbMATH DE number 1024067

Cited in

(12)

• Linear hash families and forbidden configurations
• Constructions of almost secure frameproof codes with applications to fingerprinting schemes
• Strengthening hash families and compressive sensing
• Distributing hash families with few rows
• Locating and detecting arrays for interaction faults
• Weakly biased arrays, almost independent arrays and error-correcting codes
• Constructing heterogeneous hash families by puncturing linear transversal designs
• Structures and lower bounds for binary covering arrays
• Binary Covering Arrays and Existentially Closed Graphs
• Covering arrays of higher strength from permutation vectors
• Almost \(k\)-wise independent sample spaces and their cryptologic applications
• A quantum algorithm for testing and learning resiliency of a Boolean function

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536823)