Results 211 to 220 of about 19,856 (256)
Some of the next articles are maybe not open access.
1996
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
Shahram Bakhtiari +2 more
openaire +1 more source
We give a new definition of keyed hash functions and show its relation with strongly universal hash functions and Cartesian authentication codes. We propose an algorithm for a secure keyed hash function and present preliminary result on its performance. The algorithm can be used for fast (about twice the speed of MD5) and secure message authentication.
Shahram Bakhtiari +2 more
openaire +1 more source
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
IEEE Transactions on Computers, 2005
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Hans Vandierendonck +1 more
openaire +1 more source
Bank conflicts can severely reduce the bandwidth of an interleaved multibank memory and conflict misses increase the miss rate of a cache or a predictor. Both occurrences are manifestations of the same problem: objects, which should be mapped to different indices, are accidentally mapped to the same index.
Hans Vandierendonck +1 more
openaire +1 more source
RC4-Hash: A New Hash Function Based on RC4
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).
Donghoon Chang +2 more
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
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
2012
Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of e-Almost Strongly Universal2 hash functions with much smaller description (or key) length than the Wegman-Carter construction.
Aysajan Abidin, Jan-Åke Larsson
openaire +1 more source
Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of e-Almost Strongly Universal2 hash functions with much smaller description (or key) length than the Wegman-Carter construction.
Aysajan Abidin, Jan-Åke Larsson
openaire +1 more source
Logical Analysis of Hash Functions
2005In this paper we report on a novel approach for uniform encoding of hash functions (but also other cryptographic functions) into propositional logic formulae, and reducing cryptanalysis problems to the satisfiability problem. The approach is general, elegant, and does not require any human expertise on the construction of a specific cryptographic ...
Dejan Jovanovic, Predrag Janicic
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
Proposals for Iterated Hash Functions
2008The past few years have seen an increase in the number of attacks on cryptographic hash functions. These include attacks directed at specific hash functions, and generic attacks on the typical method of constructing hash functions. In this paper we discuss possible methods for protecting against some generic attacks.
Lars R. Knudsen, Søren S. Thomsen
openaire +1 more source