Results 31 to 40 of about 3,288,500 (296)
On randomizing hash functions to strengthen the security of digital signatures [PDF]
Halevi and Krawczyk proposed a message randomization algorithm called RMX as a front-end tool to the hash-then-sign digital signature schemes such as DSS and RSA in order to free their reliance on the collision resistance property of the hash functions ...
Knudsen, Lars R. +4 more
core +1 more source
Verification of Implementations of Cryptographic Hash Functions
Cryptographic hash functions have become the basis of modern network computing for identity authorization and secure computing; protocol consistency of cryptographic hash functions is one of the most important properties that affect the security and ...
Dexi Wang +5 more
doaj +1 more source
Universal hash functions from quantum procedures
Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj +1 more source
Applying Grover's Algorithm to Hash Functions: A Software Perspective
Quantum software frameworks provide software engineers with the tools to study quantum algorithms as applied to practical problems. We implement classical hash functions MD5, SHA-1, SHA-2, and SHA-3 as quantum oracles to study the computational resource ...
Richard H. Preston
doaj +1 more source
Hash‐One: a lightweight cryptographic hash function
The increased demand for lightweight applications has triggered the need for appropriate security mechanisms in them. Lightweight cryptographic hash functions are among the major responses toward such a requirement. The authors thus have a handful of such hash functions such as QUARK, PHOTON, SPONGENT and GLUON introduced already.
Puliparambil Megha Mukundan +3 more
openaire +1 more source
On the Indifferentiability of the Grøstl Hash Function [PDF]
The notion of indifferentiability, introduced by Maurer et al., is an important criterion for the security of hash functions. Concretely, it ensures that a hash function has no structural design flaws and thus guarantees security against generic attacks up to the proven bounds. In this work we prove the indifferentiability of Grostl, a second round SHA-
Elena Andreeva 0001 +2 more
openaire +4 more sources
AbstractWe define a family of functions F from a domain U to a range R to be dispersing if for every set S ⊆ U of a certain size and random h ∈ F, the expected value of ∣S∣ – ∣h[S]∣ is not much larger than the expectation if h had been chosen at random from the set of all functions from U to R.We give near‐optimal upper and lower bounds on the size of ...
openaire +3 more sources
Can There Be a Two Way Hash Function?
It is computationally impossible for one-way hash functions to obtain the original data again. In this study, Two Way Hash Function (TWHF) is proposed which provides the security properties of one-way hash functions. TWHF aims to hash/encrypt and decrypt
Timucin Koroglu, Refik Samet
doaj +1 more source
High Performance and Low Power Hardware Implementation for Cryptographic Hash Functions
Since hash functions are cryptography's most widely used primitives, efficient hardware implementation of hash functions is of critical importance. The proposed high performance hardware implementation of the hash functions used sponge construction which
Yunlong Zhang +3 more
doaj +1 more source

