713 search results - page 23 / 143 » Dispersing Hash Functions |
64
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
TISSEC
2010
14 years 4 months ago
2010
We revisit the problem of constructing a protocol for performing authenticated encryption with associated data (AEAD). A technique is described which combines a collision resistant...
LATINCRYPT
2010
14 years 8 months ago
2010
Let E be a non-supersingular elliptic curve over a finite field Fq. At CRYPTO 2009, Icart introduced a deterministic function Fq → E(Fq) which can be computed efficiently, and ...
INTEGRATION
2007
14 years 9 months ago
2007
The ubiquitous presence of mobile devices and the demand for better performance and efficiency have motivated research into embedded implementations of cryptography algorithms. I...
71
Voted
ACISP
2008
Springer
15 years 4 months ago
2008
Springer
LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In th...