Results 131 to 140 of about 44,375 (171)

Source Coding Using Families of Universal Hash Functions

Source Coding Using Families of Universal Hash Functions
openaire  

Some of the next articles are maybe not open access.

Related searches:

Universal Hash-Function Families: From Hashing to Authentication

Lecture Notes in Computer Science, 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.
Basel Alomair
exaly   +2 more sources

Higher Order Universal One-Way Hash Functions [PDF]

Lecture Notes in Computer Science, 2004
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from the family. Their main security property is that it should be hard to find a second input that collides with the target input.
Bart Preneel
exaly   +2 more sources

$$\varepsilon $$-Almost collision-flat universal hash functions and mosaics of designs

Designs, Codes, and Cryptography, 2023
AbstractWe introduce, motivate and study $$\varepsilon $$ ε -almost collision-flat universal (ACFU) hash functions $$f:\mathcal X\times \mathcal S\rightarrow \mathcal A$$ f : X × S →
Moritz Wiese, Holger Boche
exaly   +4 more sources

On Security of Universal Hash Function Based Multiple Authentication

Lecture Notes in Computer Science, 2012
Universal hash function based multiple authentication was originally proposed by Wegman and Carter in 1981. In this authentication, a series of messages are authenticated by first hashing each message by a fixed (almost) strongly universal2 hash function and then encrypting the hash value with a preshared one-time pad.
Aysajan Abidin
exaly   +2 more sources

Source Coding Using Families of Universal Hash Functions [PDF]

IEEE Transactions on Information Theory, 2007
This correspondence is concerned with new connections between source coding and two kinds of families of hash functions known as the families of universal hash functions and N-strongly universal hash functions, where N ges 2 is an integer. First, it is pointed out that such families contain classes of well-known source codes such as bin codes and ...
Hiroki Koga
exaly   +2 more sources

On the relationships between perfect nonlinear functions and universal hash families

Theoretical Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Liu
exaly   +3 more sources

Universal classes of hash functions (Extended Abstract)

Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77, 1977
This paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of the ...
Larry Carter, Mark N. Wegman
openaire   +1 more source

Evolving Universal Hash Functions Using Genetic Algorithms

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, 2009
In this paper we explore the use of metaheuristic functions, namely Genetic Algorithms to construct Universal Hash Functions to efficiently hash a given set of keys. The Hash Functions generated in this way should give lesser number of collisions as compared to selecting them randomly from a family of Universal Hash Functions.
Ramprasad Joshi
exaly   +2 more sources

Universal hash functions for an infinite universe and hash trees

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