Sciweavers

36 search results - page 1 / 8
» Hash Functions Based on Large Quasigroups
Sort
View
ICCS
2009
Springer
15 years 4 months ago
Hash Functions Based on Large Quasigroups
Václav Snásel, Ajith Abraham, Jiri D...
81
Voted
JOC
1998
135views more  JOC 1998»
14 years 9 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
67
Voted
ASIACRYPT
2003
Springer
15 years 2 months ago
Incremental Multiset Hash Functions and Their Application to Memory Integrity Checking
We introduce a new cryptographic tool: multiset hash functions. Unlike standard hash functions which take strings as input, multiset hash functions operate on multisets (or sets). ...
Dwaine E. Clarke, Srinivas Devadas, Marten van Dij...
CVPR
2012
IEEE
13 years 3 days ago
Spherical hashing
Many binary code encoding schemes based on hashing have been actively studied recently, since they can provide efficient similarity search, especially nearest neighbor search, an...
Jae-Pil Heo, Youngwoon Lee, Junfeng He, Shih-Fu Ch...
GLOBECOM
2008
IEEE
14 years 9 months ago
On the Impact of Caching for High Performance Packet Classifiers
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
Harald Widiger, Andreas Tockhorn, Dirk Timmermann