Sciweavers

2157 search results - page 3 / 432
» Optimal Fast Hashing
Sort
View
CRYPTO
1995
Springer
140views Cryptology» more  CRYPTO 1995»
13 years 9 months ago
Bucket Hashing and its Application to Fast Message Authentication
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
Phillip Rogaway
ACNS
2005
Springer
111views Cryptology» more  ACNS 2005»
13 years 11 months ago
Badger - A Fast and Provably Secure MAC
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is us...
Martin Boesgaard, Thomas Christensen, Erik Zenner
ACSC
2009
IEEE
14 years 17 days ago
Fast and Compact Hash Tables for Integer Keys
A hash table is a fundamental data structure in computer science that can offer rapid storage and retrieval of data. A leading implementation for string keys is the cacheconscious...
Nikolas Askitis
JOC
1998
135views more  JOC 1998»
13 years 5 months ago
Attacks on Fast Double Block Length Hash Functions
The security of hash functions based on a block cipher with a block length of m bits and a key length of k bits, where k ≤ m, is considered. New attacks are presented on a large ...
Lars R. Knudsen, Xuejia Lai, Bart Preneel
ICDCS
2008
IEEE
14 years 6 days ago
Fast Path Session Creation on Network Processors
The security gateways today are required not only to block unauthorized accesses by authenticating packet headers, but also by inspecting connection states to defend against malic...
Bo Xu, Yaxuan Qi, Fei He, Zongwei Zhou, Yibo Xue, ...