Results 151 to 160 of about 44,375 (171)

Divide-and-concatenate: an architecture level optimization technique for universal hash functions

Proceedings of the 41st annual Design Automation Conference, 2004
The authors present an architectural optimization technique called divide-and-concatenate for hardware architectures of universal hash functions based on three observations: 1) the area of a multiplier and associated data path decreases quadratically and their speeds increase gradually as their operand size is reduced; 2) multiplication is at the core ...
Bo Yang 0010, Ramesh Karri, David A. McGrew   +2 more
openaire   +1 more source

On Universal Classes of Extremely Random Constant-Time Hash Functions

SIAM Journal on Computing, 2004
Summary: A family of functions \(F\) that map \([0,m-1]\) into \([0,n-1]\) is said to be \(\kappa\)-wise independent if any tuple of \(\kappa\) distinct points in \([0,m-1]\) have a corresponding image, for a randomly selected \(f\in F\), that is uniformly distributed in \([0,n-1]^{\kappa}\).
openaire   +1 more source

A combinatorial characterization of certain universal classes of hash functions

Journal of Combinatorial Designs, 1994
AbstractA new lower bound on the size of ϵ‐almost strongly universal2 classes of hash functions has recently been obtained by Stinson [8]. In this article we present a characterization of ϵ − ASU2 classes of hash functions meeting the Stinson bound in terms of combinatorial designs. © 1994 John Wiley & Sons, Inc.
openaire   +2 more sources

A note on universal classes of hash functions

Information Processing Letters, 1980
openaire   +2 more sources

Non-adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions

Lecture Notes in Computer Science, 2023
Noam Mazor
exaly  

ε-Almost Collision-Flat Universal Hash Functions Motivated by Information-Theoretic Security

2023
Moritz Wiese, Holger Boche
exaly  

More Efficient Privacy Amplification With Less Random Seeds via Dual Universal Hash Function

IEEE Transactions on Information Theory, 2016
Masahito Hayashi, Toyohiro Tsurumaru
exaly  

Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions

IEEE Transactions on Information Theory, 2009
Palash Sarkar
exaly  

Power Optimization for Universal Hash Function Data Path Using Divide-and-Concatenate Technique

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007
Ramesh Karri
exaly  

Divide-and-concatenate: an architecture-level optimization technique for universal hash functions

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005
Ramesh Karri
exaly