Results 1 to 10 of about 4,088 (185)

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

open access: yesIACR 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   +5 more sources

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

open access: yesIACR 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   +5 more sources

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

open access: yesInternational 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   +2 more sources

New Second-Preimage Attacks on Hash Functions [PDF]

open access: yesJournal of Cryptology, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreeva, Elena   +7 more
openaire   +4 more sources

Improved MITM Cryptanalysis on Streebog

open access: yesIACR Transactions on Symmetric Cryptology, 2022
At ASIACRYPT 2012, Sasaki et al. introduced the guess-and-determine approach to extend the meet-in-the-middle (MITM) preimage attack. At CRYPTO 2021, Dong et al.
Jialiang Hua   +5 more
doaj   +1 more source

Preimage Attack on BioHashing [PDF]

open access: yesProceedings 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 ...
Lacharme, Patrick   +2 more
openaire   +3 more sources

Automatic Preimage Attack Framework on Ascon Using a Linearize-and-Guess Approach

open access: yesIACR Transactions on Symmetric Cryptology, 2023
Ascon is the final winner of the lightweight cryptography standardization competition (2018 − 2023). In this paper, we focus on preimage attacks against round-reduced Ascon.
Huina Li   +4 more
doaj   +1 more source

Classical and Quantum Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing

open access: yesIACR Transactions on Symmetric Cryptology, 2023
At EUROCRYPT 2006, Kelsey and Kohno proposed the so-called chosen target forced-prefix (CTFP) preimage attack, where for any challenge prefix P, the attacker can generate a suffix S such that H(P∥S) = y for some hash value y published in advance by the ...
Zhiyu Zhang   +3 more
doaj   +1 more source

Preimage Attack on 23-Step Tiger [PDF]

open access: yesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2011
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.
Lei WANG, Yu SASAKI
openaire   +2 more sources

REISCH: incorporating lightweight and reliable algorithms into healthcare applications of WSNs [PDF]

open access: yes, 2020
Healthcare institutions require advanced technology to collect patients' data accurately and continuously. The tradition technologies still suffer from two problems: performance and security efficiency.
Al-Zubaidie, Mishall   +2 more
core   +2 more sources

Home - About - Disclaimer - Privacy