Sciweavers

2157 search results - page 4 / 432
» Optimal Fast Hashing
Sort
View
INDOCRYPT
2005
Springer
15 years 5 months ago
Towards Optimal Double-Length Hash Functions
In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and ...
Mridul Nandi
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 11 months ago
Optimal hash functions for approximate closest pairs on the n-cube
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...
Daniel M. Gordon, Victor Miller, Peter Ostapenko
87
Voted
IJSN
2007
106views more  IJSN 2007»
14 years 11 months ago
Hash-AV: fast virus signature scanning by cache-resident filters
Abstract— Fast virus scanning is becoming increasingly important in today’s Internet. While Moore’s law continues to double CPU cycle speed, virus scanning applications fail ...
Ozgun Erdogan, Pei Cao
CORR
2011
Springer
198views Education» more  CORR 2011»
14 years 6 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
142
Voted
SIGCOMM
2005
ACM
15 years 5 months ago
Fast hash table lookup using extended bloom filter: an aid to network processing
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
Haoyu Song, Sarang Dharmapurikar, Jonathan S. Turn...