122 search results - page 5 / 25 » Reducing the Storage Requirements of a Perfect Hash Function |
ACNS
2007
Springer
14 years 1 months ago
2007
Springer
We present two transforms to acquire chosen ciphertext security from tag based techniques. The first one requires the separability of underlying primitives. By separability, info...
SACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
FROCOS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducin...
SPDP
1993
IEEE
13 years 11 months ago
1993
IEEE
In PRAM emulations, universal hashing is a well-known method for distributing the address space among memory modules. However, if the memory access patterns of an application ofte...
TPDS
1998
13 years 7 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...