Results 31 to 40 of about 3,739 (238)

Differential-Aided Preimage Attacks On Round-Reduced Keccak

The Computer Journal, 2023
Abstract At FSE 2008, Leurent introduced the preimage attack on MD4 by exploiting differential trails. In this paper, we apply the differential-aided preimage attack to Keccak with the message modification techniques. Instead of directly finding the preimage, we exploit differential characteristics to modify the messages, so that the ...
Congming Wei, Xiaoyang Dong, Willi Meier, Lingyue Qin, Ximing Fu   +4 more
semanticscholar   +2 more sources

Quantum Resource Analysis of Low-Round Keccak/SHA-3 Preimage Attack: From Classical 2^ 57.8 to Quantum 2 ^28.9 using Qiskit Modeling [PDF]

IACR Cryptology ePrint Archive
This paper presents a hardware-conscious analysis of the quantum acceleration of the classical 3-round Keccak-256 preimage attack using Grover's Algorithm. While the theoretical quantum speed-up from T_cl=2^{57.8} (classical) to T_qu = 2^{28.9} (quantum)
Ramin Rezvani Gilkolaei, Reza Ebrahimi
semanticscholar   +2 more sources

Tamper-Proof Document Storage Using IPFS and Keccak-256 Hashing

Social Science Research Network
Abhishek Veer, Rashmi Ashtagi, Kanchan Swami, Sai Watile, Abbas Shaikh   +4 more
semanticscholar   +2 more sources

Performance Analysis of Keccak f-[1600] [PDF]

International Journal of Advanced Computer Science and Applications, 2013
Keccak is the latest Hash Function selected as the winner of NIST Hash Function Competition. SHA-3 is not meant to replace SHA-2 as no significant attacks on SHA-2 have been demonstrated. But it is designed in response to the need to find an alternative and dissimilar construct for Cryptographic Hash that is more fortified to attacks.
Ananya Chowdhury, Utpal Kumar
openaire   +3 more sources

Improving security of lightweith SHA-3 against preimage attacks [PDF]

International Journal of Electronics and Telecommunications, 2018
In this article we describe the SHA-3 algorithm and its internal permutation in which potential weaknesses are hidden. The hash algorithm can be used for different purposes, such aspseudo-random bit sequences generator, key wrapping or one pass ...
Serhii Onopa, Zbigniew Kotulski
doaj   +1 more source

Efficient computation of hashes [PDF]

, 2014
The sequential computation of hashes at the core of many distributed storage systems and found, for example, in grid services can hinder efficiency in service quality and even pose security challenges that can only be addressed by the use of parallel ...
, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Bertoni G, Blelloch G E, Blum M, Coron J S, Damgard I B, Hall E, Peter R Hobson, Raul H C Lopes, Ristenpart T, Sarkar P, Virginia N L Franqueira   +16 more
core   +3 more sources

Efficient hardware implementations of high throughput SHA-3 candidates keccak, luffa and blue midnight wish for single- and multi-message hashing [PDF]

, 2010
In November 2007 NIST announced that it would organize the SHA-3 competition to select a new cryptographic hash function family by 2012. In the selection process, hardware performances of the candidates will play an important role.
Akın, Abdulkadir, Akin, Abdulkadir, Aysu, Aydın, Aysu, Aydin, Savas, Erkay, Savaş, Erkay, Ulusel, Onur Can   +6 more
core   +2 more sources

Implementation and integration of Keccak accelerator on RISC-V for CRYSTALS-Kyber

ACM International Conference on Computing Frontiers, 2023
One of the key metrics used for defying the security of the Internet of Things (IoT) is data integrity, which mostly relies on the use of cryptographic hash functions. In the last years, the National Institute of Standards and Technology (NIST) announced
Alessandra Dolmeta, Mattia Mirigaldi, M. Martina, G. Masera   +3 more
semanticscholar   +1 more source

Improved Preimage Attacks on 4-Round Keccak-224/256

IACR Transactions on Symmetric Cryptology, 2021
This paper provides an improved preimage attack method on standard 4-round Keccak-224/256. The method is based on the work pioneered by Li and Sun, who design a linear structure of 2-round Keccak-224/256 with 194 degrees of freedom left.
Le He, Xiaoen Lin, Hongbo Yu
doaj   +1 more source

New Attacks on Keccak-224 and Keccak-256 [PDF]

, 2012
The Keccak hash function is one of the five finalists in NIST's SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: After several years of cryptanalysis and a lot of effort, the largest number of Keccak rounds for which actual collisions were found was only 2.
Itai Dinur, Orr Dunkelman, Adi Shamir
openaire   +1 more source