Results 31 to 40 of about 26,379 (302)
On the Indifferentiability of the Grøstl Hash Function [PDF]
, 2010 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 +3 more sources
, 2020 Examples of Grover's search algorithm for finding preimages of scaled down versions of Sponge Hash, and Blake2 Hash constructions in OpenQASM language.
Stefano Carrazza, Sergi Ramos
core +1 more source
Cryptographic Hash Functions [PDF]
, 2010 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 +1 more source
CAAI Transactions on Intelligence Technology, EarlyView., 2023 Abstract This research focuses on addressing the privacy issues in healthcare advancement monitoring with the rapid establishment of the decentralised communication system in the Internet of Medical Things (IoMT). An integrated blockchain homomorphic encryption standard with an in‐build supervised learning‐based smart contract is designed to improvise ...
Chandramohan Dhasarathan +7 more
wiley +1 more source
Challenging the increased resistance of regular hash functions against birthday attacks
Journal of Mathematical Cryptology, 2012 At Eurocrypt 2004, Bellare and Kohno presented the concept of a regular hash function. For a hash function to be regular, every hash value must have the same number of preimages in the domain.
Mouha Nicky, Sekar Gautham, Preneel Bart
doaj +1 more source
A secure and efficient cryptographic hash function based on NewFORK-256
Egyptian Informatics Journal, 2012 Cryptographic hash functions serve as a fundamental building block of information security and are used in numerous security applications and protocols such as digital signature schemes, construction of MAC and random number generation, for ensuring data
Harshvardhan Tiwari, Krishna Asawa
doaj +1 more source
Hash‐One: a lightweight cryptographic hash function
IET Information Security, 2016 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
Secure Parallel Image Cryptographic Hash Function Using a Novel 2D High-Randomness Hyperchaotic Map
MathematicsFor image data, the processing of each pixel using a cryptographic hash function is linear, and the existing cryptographic hash function lacks parallel processing of image width and height.
Mingrui Qi, Dongdong Wang
doaj +1 more source
, 2020 Python code using the Qibo library that follows the paper Quantum Search for Scaled Hash Function ...
Stefano Carrazza, Sergi Ramos
core +1 more source
The suffix-free-prefix-free hash function construction and its indifferentiability security analysis [PDF]
, 2012 In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value $$(IV)$$ of hash functions is fixed.
Zenner, Erik +4 more
core +1 more source