Results 11 to 20 of about 4,088 (185)
A Second Preimage Attack on the XOR Hash Combiner
IET Information SecurityThe exclusive-or (XOR) hash combiner is a classical hash function combiner, which is well known as a good PRF and MAC combiner, and is used in practice in TLS versions 1.0 and 1.1.
Shiwei Chen +3 more
doaj +2 more sources
Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems
IET Information Security, 2023 In this paper, improved preimage attacks are presented on 3‐round Keccak‐256 and Keccak‐512 and 4‐round Keccak‐256 based on algebraic methods. The authors propose some new properties about the components of Keccak permutation, reconsider the existing ...
Junling Pei, Lusheng Chen
doaj +1 more source
A preimage attack on reduced GIMLI‐HASH with unbalanced squeezing phase
IET Information Security, 2023 In Conference on Cryptographic Hardware and Embedded System 2017, Bernstein et al. proposed GIMLI, a 384‐bit permutation with 24 rounds, which aims to provide high performance on various platforms.
Yongseong Lee +3 more
doaj +1 more source
Practical Preimages for Maraca [PDF]
, 2009 We show a practical preimage attack on the cryptographic hash function Maraca, which was submitted as a candidate to the NIST SHA-3 competition.
Indesteege, Sebastiaan, Preneel, Bart
core +1 more source
Improved preimage attack on one-block MD4 [PDF]
Journal of Systems and Software, 2012 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 +1 more source
Improved Meet-in-the-Middle Preimage Attacks against AES Hashing Modes
IACR Transactions on Symmetric Cryptology, 2020 Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the underlying block cipher are referred to as AES hashing modes.
Zhenzhen Bao +4 more
doaj +1 more source
On hash functions using checksums [PDF]
, 2008 We analyse the security of iterated hash functions that compute an input dependent checksum which is processed as part of the hash computation. We show that a large class of such schemes, including those using non-linear or even one-way checksum ...
J. Hoch +7 more
core +3 more sources
Preimage and Collision Attacks on MD2 [PDF]
, 2005 This paper contains several attacks on the hash function MD2 which has a hash code size of 128 bits. At Asiacrypt 2004 Muller presents the first known preimage attack on MD2. The time complexity of the attack is about 2104 and the preimages consist always of 128 blocks.
Lars R. Knudsen, John E. Mathiassen
openaire +1 more source
Classical Verification of Quantum Computations [PDF]
, 2018 We present the first protocol allowing a classical computer to interactively verify the result of an efficient quantum computation. We achieve this by constructing a measurement protocol, which enables a classical verifier to use a quantum prover as a ...
Mahadev, Urmila
core +2 more sources
Applying Grover's Algorithm to Hash Functions: A Software Perspective
IEEE Transactions on Quantum Engineering, 2022 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