Results 181 to 190 of about 17,753 (215)
Some of the next articles are maybe not open access.
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
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas
2014We define the concept of a quantum hash generator and offer a design, which allows one to build a large number of different quantum hash functions. The construction is based on composition of a classical ε-universal hash family and a given family of functions - quantum hash generators.
Marat Ablayev, Farid Ablayev
openaire +4 more sources
Analysis of a universal class of hash functions
1978In 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.
Mark N. Wegman +2 more
openaire +1 more source
A caution on universal classes of hash functions
Information Processing Letters, 1991Abstract Universal classes of hash functions of the form ((A × Key + B) mod P) mod Size, where A, B, and P (a prime greater than A and B) are constants and Size is the number of hash addresses, have come into common use. Theory and practical tests have shown that for random choices of the constants, excellent performance is to be expected. This paper
openaire +2 more sources
A new universal class of hash functions and dynamic hashing in real time
2005The 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 +1 more
openaire +1 more source
Aggregated Authentication (AMAC) Using Universal Hash Functions
2009Aggregation is a very important issue to reduce the energy consumption in Wireless Sensors Networks (WSNs). There is currently a lack of cryptographic primitives for authentication of aggregated data. The theoretical background for Aggregated Message Authentication Codes (AMACs) has been proposed by Chan and Castelluccia at ISIT 08.
Znaidi, Wassim +2 more
openaire +3 more sources
Efficient Strongly Universal and Optimally Universal Hashing
1999New 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 +2 more sources
On the Universal Hash Functions in Luby-Rackoff Cipher
2003It is known that a super-pseudorandom permutation on 2n bits can be obtained from a random function f on n bits and two bisymmetric and AXU hash functions h1 and h2 on n bits. It has a Feistel type structure which is usually denoted by φ(h1, f, f, h2).
Tetsu Iwata, Kaoru Kurosawa
openaire +2 more sources
On the program size of perfect and universal hash functions
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently.
openaire +1 more source