Results 31 to 40 of about 442,051 (179)
In this paper, we describe attacks on the recently proposed Haraka hash functions. First, for the two hash functions Haraka-256/256 and Haraka-512/256 in the family, we show how two colliding messages can be constructed in about 216 function ...
Jérémy Jean
doaj +1 more source
In modern cryptography, hash functions are considered as one of the key components for secure communication. They play a vital role in a wide range of applications such as ensuring the authentication and integrity of the data, in forensic investigation ...
Darshana Upadhyay +3 more
doaj +1 more source
We propose a preimage attack against cryptographic hash functions based on the speedup enabled by quantum computing. Preimage resistance is a fundamental property cryptographic hash functions must possess. The motivation behind this work relies in the lack of conventional attacks against newly introduced hash schemes such as the recently elected SHA-3 ...
openaire +3 more sources
A second preimage attack on zipper hash
AbstractThe zipper hash utilizes two‐pass hashing to strengthen the iterated hash functions against the generic attack. In this paper, we analyze the features of zipper hash and several existing generic attacks on hash functions. A new tree structure called inverse‐diamond, which starts from one fixed point and ends with many points, is exploited to ...
Shiwei Chen, Chenhui Jin
openaire +1 more source
Allocating Rotational Cryptanalysis based Preimage Attack on 4-round Keccak-224 for Quantum Setting [PDF]
In this paper, we aim to present a quantum setting oriented preimage attack against 4-round Keccak-224. An important technique we called the allocating rotational cryptanalysis takes the preimage attack into the situation of 2-block preimage recovery ...
Juntao Gao +4 more
core +1 more source
A (Second) Preimage Attack on the GOST Hash Function [PDF]
In this article, we analyze the security of the GOST hash function with respect to (second) preimage resistance. The GOST hash function, defined in the Russian standard GOST-R 34.11-94, is an iterated hash function producing a 256-bit hash value. As opposed to most commonly used hash functions such as MD5 and SHA-1, the GOST hash function defines, in ...
Florian Mendel +2 more
openaire +3 more sources
Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures
In this paper, based on the work pioneered by Aumasson and Meier, Dinur et al., and Guo et al., we construct some new delicate structures from the roundreduced versions of Keccakhash function family. The new constructed structures are called cross-linear
Ting Li +3 more
doaj +1 more source
An electro‐templating strategy directs the relaxation of cholesteric finger loops into discrete concentric rings whose geometry is electrically programmed. The photopolymerized structures retain the topological defect pattern and, upon heating, show reversible, castle‐like surface modulation.
Jacques A. Peixoto +4 more
wiley +1 more source
Preimage Attack on Parallel FFT-Hashing [PDF]
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest.
Donghoon Chang
core +1 more source
GENIAL framework. Summary of the main steps of the framework to infer and analyze GRN. Summary Tomato (Solanum lycopersicum), despite being the most important vegetable crop world‐wide, remains vulnerable to over 200 diseases caused by different pests.
Maxime Multari +12 more
wiley +1 more source

