9 search results - page 2 / 2 » Explicit constructions for perfect hash families |
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
The collision-resistance of hash functions is an important foundation of many cryptographic protocols. Formally, collision-resistance can only be expected if the hash function in f...
MOC
2002
13 years 4 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
SIAMDM
1998
13 years 4 months ago
1998
In this paper, we investigate combinatorialproperties and constructions of two recent topics of cryptographic interest, namely frameproof codes for digital ngerprinting, and trace...
ICIP
1997
IEEE
14 years 6 months ago
1997
IEEE
We de ne and construct a new family of compactly supported, nonseparable two-dimensional wavelets, biorthogonal quincunx Coifman wavelets" BQCWs, from their one-dimensional c...