Results 21 to 30 of about 442,051 (179)
Improved preimage attack on one-block MD4 [PDF]
MD4 is a hash function designed by Rivest in 1990. The design philosophy of many important hash functions, such as MD5, SHA-1 and SHA-2, originated from that of MD4. We propose an improved preimage attack on one-block MD4 with the time complexity 2^9^5 MD4 compression function operations, as compared to the 2^1^0^7 complexity of the previous attack by ...
Jinmin Zhong, Xuejia Lai
openaire +2 more sources
Improved Preimage Attacks on 3-Round Keccak-224/256
In this paper, we provide an improved method on preimage attacks of standard 3-round Keccak-224/256. Our method is based on the work by Li and Sun. Their strategy is to find a 2-block preimage instead of a 1-block one by constructing the first and second
Xiaoen Lin, Le He, Hongbo Yu
doaj +1 more source
Preimage Attacks on Some Hashing Modes Instantiating Reduced-Round LBlock
In this paper, we present preimage attacks on several hashing modes instantiating reduced-round LBlock. It is observed that the omission of the network twist in the last round and the diffusion of the permutation in round function are the key points for ...
Shiwei Chen, Chenhui Jin
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
The Legendre Symbol and the Modulo-2 Operator in Symmetric Schemes over Fnp
Motivated by modern cryptographic use cases such as multi-party computation (MPC), homomorphic encryption (HE), and zero-knowledge (ZK) protocols, several symmetric schemes that are efficient in these scenarios have recently been proposed in the ...
Lorenzo Grassi +3 more
doaj +1 more source
Exploiting Weak Diffusion of Gimli: Improved Distinguishers and Preimage Attacks
The Gimli permutation proposed in CHES 2017 was designed for cross-platform performance. One main strategy to achieve such a goal is to utilize a sparse linear layer (Small-Swap and Big-Swap), which occurs every two rounds.
Fukang Liu, Takanori Isobe, Willi Meier
doaj +1 more source
Preimage Attack on 23-Step Tiger
This paper evaluates the preimage resistance of the Tiger hash function. To our best knowledge, the maximum number of the attacked steps is 17 among previous preimage attacks on Tiger, where the full version has 24 steps. Our attack will extend the number of the attacked steps to 23.
WANG, Lei, SASAKI, Yu
openaire +2 more sources
Tag Second-preimage Attack against π-cipher [PDF]
The π-cipher is one of the candidates of the CAESAR competition. One of the advertised features of the π-cipher is tag second-preimage resistance: it should be hard to generate a message with a given tag, even for the legitimate key holder (insider ...
Leurent, Gaëtan
core +1 more source
Improved Preimage Attack on One-block MD4 [PDF]
We propose an improved preimage attack on one-block MD4 with the time complexity $2^{94.98}$ MD4 compression function operations, as compared to $2^{107}$ in \cite{AokiS-sac08}.
Xuejia Lai, Jinmin Zhong
core +1 more source
Improved preimage and pseudo-collision attacks on SM3 hash function
A preimage attack on 32-step SM3 hash function and a pseudo-collision attack on 33-step SM3 hash function respectively were shown.32-step preimage attack was based on the differential meet-in-the-middle and biclique technique,while the previously known ...
Jian ZOU, Le DONG
doaj +2 more sources

