Results 251 to 260 of about 3,288,500 (296)
Some of the next articles are maybe not open access.
Learning to hash: forgiving hash functions and applications
Data Mining and Knowledge Discovery, 2008The problem of efficiently finding similar items in a large corpus of high-dimensional data points arises in many real-world tasks, such as music, image, and video retrieval. Beyond the scaling difficulties that arise with lookups in large data sets, the complexity in these domains is exacerbated by an imprecise definition of similarity. In this paper,
Shumeet Baluja, Michele Covell
openaire +1 more source
Collections of Functions for Perfect Hashing
SIAM Journal on Computing, 1986Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance. Such a technique has been called “perfect hashing”
Francine Berman +4 more
openaire +2 more sources
Spongent: A Lightweight Hash Function [PDF]
This paper proposes spongent - a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construction instantiated with a present-type permutation, following the hermetic sponge strategy.
Ingrid Verbauwhede, Gregor Leander
exaly +3 more sources
European Transactions on Telecommunications, 1994
AbstractHash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks.
openaire +1 more source
AbstractHash functions were introduced in cryptology in the late seventies as a tool to protect the authenticity of information. Soon it became clear that they were a very useful building block to solve other security problems in telecommunication and computer networks.
openaire +1 more source
RC4-Hash: A New Hash Function Based on RC4
Lecture Notes in Computer Science, 2006In this paper, we propose a new hash function based on RC4 and we call it RC4-Hash. This proposed hash function produces variable length hash output from 16 bytes to 64 bytes. Our RC4-Hash has several advantages over many popularly known hash functions. Its efficiency is comparable with widely used known hash function (e.g., SHA-1).
Mridul Nandi, Donghoon Chang
exaly +2 more sources
Universal hash functions for an infinite universe and hash trees
Information Processing Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
On selectable collisionful hash functions
1996This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses of his method are studied and possible solutions are given. Some secure methods that require additional assumptions are also suggested.
Shahram Bakhtiari +2 more
openaire +1 more source
On the design of special hash functions for multiple hash tables
2012 9th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE), 2012One disadvantage of bitstate hashing, the traditional probabilistic state space analysis method, is the possible large amount of wasted memory for achieving a high probability of no address collision in hashing. We look at tradeoff between hashing speed and memory assigned for hashing. This paper presents a method using multiple hash tables and special
openaire +1 more source
Universal Hash-Function Families: From Hashing to Authentication
2014Due to their potential use as building blocks for constructing highly efficient message authentication codes (MACs), universal hash-function families have been attracting increasing research attention, both from the design and analysis points of view.
openaire +2 more sources

