Results 1 to 10 of about 4,920 (187)
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 +7 more sources
Improved Preimage Attacks on 3-Round Keccak-224/256
IACR Transactions on Symmetric Cryptology, 2021 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 +7 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 +4 more sources
Preimage Attack on BioHashing [PDF]
Proceedings of the 10th International Conference on Security and Cryptography, 2013 Biometric recognition is more and more employed in authentication and access control of various applications. Biometric data are strongly linked with the user and do not allow revocability nor diversity, without an adapted post-processing. Cancelable biometrics, including the very popular algorithm BioHashing, is used to cope with the underlying ...
Patrick Lacharme +2 more
+7 more sources
Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems [PDF]
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 +2 more sources
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 +4 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 Erik Mathiassen
openalex +2 more sources
A preimage attack on reduced GIMLI‐HASH with unbalanced squeezing phase [PDF]
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 +2 more sources
On quantum preimage attacks [PDF]
, 2014 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 ...
Răzvan Roşie
+5 more sources
Preimage Attacks on Some Hashing Modes Instantiating Reduced-Round LBlock
IEEE Access, 2018 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 +2 more sources