Results 11 to 20 of about 3,288,500 (296)
Parameterized Hash Functions [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tomasz Bilski +3 more
core +5 more sources
The Grindahl Hash Functions [PDF]
In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the important feature that no low-weight characteristics form collisions, and at the same time it limits access to the state.
Lars R. Knudsen +2 more
openaire +3 more sources
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 +3 more sources
Proposals for Iterated Hash Functions
The 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 +4 more sources
Evolving hash functions by means of genetic programming [PDF]
Proceedings of the 8th annual conference on Genetic and evolutionary computation. Seattle, Washington, USA, July 08-12, 2006The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use
Ribagorda Garnacho, Arturo +10 more
core +1 more source
On Cryptographic Hash Functions: Definitions, Ideas and Practical Cryptographic Attacks [PDF]
openHash functions, and cryptographic hash functions in particular, underpin the technologies on which modern life is built. Efficient databases, the Internet, the World Wide Web, online payments and more, would not be possible without the security and ...
DALLATORRE, FILIPPO
core
Quantum collision finding for homomorphic hash functions [PDF]
Hash functions are a basic cryptographic primitive. Certain hash functions try to prove security against collision and preimage attacks by reductions to known hard problems. These hash functions usually have some additional properties that allow for that
Juan Carlos Garcia-Escartin +2 more
core +1 more source
On hash functions using checksums [PDF]
We analyse the security of iterated hash functions that compute an input dependent checksum which is processed as part of the hash computation. We show that a large class of such schemes, including those using non-linear or even one-way checksum ...
Knudsen, Lars R. +9 more
core +1 more source
Cryptographic Hash Functions [PDF]
Cryptographic hash functions are an important tool of cryptography and play a fundamental role in efficient and secure information processing. A hash function processes an arbitrary finite length input message to a fixed length output referred to as the ...
Knudsen, Lars R. +4 more
core +2 more sources
HMNT: Hash Function Based on New Mersenne Number Transform
In the field of information security, hash functions are considered important as they are used to ensure message integrity and authentication. Despite various available methods to design hash functions, the methods have been proven to time inefficient ...
Ali Maetouq, Salwani Mohd Daud
doaj +1 more source

