Results 191 to 200 of about 1,013,929 (223)

Concept of applying universal hashing and open addressing for performance enhancement of Lazy Learning method

2012 Third International Conference on Emerging Applications of Information Technology, 2012
Atal Chaudhuri
exaly   +2 more sources

Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes

2009
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T 1 and T 2 each of which has m cells of capacity 1 such that constant access time is guaranteed. For m ≥ (1 + e)n and hash functions h 1, h 2 that are c logn-wise independent, Pagh [11] showed that the keys of an arbitrary set S can be stored using
Martin Dietzfelbinger, Ulf Schellbach
openaire   +1 more source

Universal hashing in VLSI

2006
A problem is presented with deterministic VLSI complexity AT det 2 =Ω(N2), but Las Vegas complexity only AT Las Vegas 2 =O (N poly(logN)). (The Las Vegas algorithm always decides correctly, but T is only the expected running time; A is the area of the chip).
openaire   +1 more source

Universally composable anonymous Hash certification model

Science in China Series F: Information Sciences, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan Zhang, Jianfeng Ma 0001, Sang-Jae Moon   +2 more
openaire   +2 more sources

Universal Hashing Based on Field Multiplication and (Near-)MDS Matrices

IACR Cryptology ePrint Archive, 2023
Koustabh Ghosh, Jonathan Fuchs, P. A. Eliasi, J. Daemen   +3 more
semanticscholar   +1 more source

A caution on universal classes of hash functions

Information Processing Letters, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Universal Hash-Function Families: From Hashing to Authentication

2014
Due 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   +1 more source

Analysis of a universal class of hash functions

1978
In this paper we use linear algebraic methods to analyze the performance of several classes of hash functions, including the class H2 presented by Carter and Wegman [2]. Suppose H is a suitable class, the hash functions in H map A to B, S is any subset of A whose size is equal to that of B, and x is any element of A.
George Markowsky, Larry Carter, Mark N. Wegman   +2 more
openaire   +1 more source

Efficient Strongly Universal and Optimally Universal Hashing

1999
New hash families are analyzed, mainly consisting of the hash functions ha,b : {0,..., u - 1} → {0,..., r - 1}, x → ((ax + b) mod(kr)) div k. Universal classes of such functions have already been investigated in [5, 6], and used in severail applications, e.g. [3,9].
openaire   +1 more source

A new universal class of hash functions and dynamic hashing in real time

2005
The paper presents a new universal class of hash functions which have many desirable features of random functions, but can be (probabilistically) constructed using sublinear time and space, and can be evaluated in constant time.
Martin Dietzfelbinger, Friedhelm Meyer auf der Heide   +1 more
openaire   +1 more source