Results 1 to 10 of about 136,870 (135)

Internal collision attack on Maraca [PDF]

open access: yes, 2009
We present an internal collision attack against the new hash function Maraca which has been submitted to the SHA-3 competition. This attack requires 2^{237} calls to the round function and its complexity is lower than the complexity of the generic ...
Canteaut, Anne, Naya-Plasencia, Maria
core   +5 more sources

Instruction-Fetching Attack and Practice in Collision Fault Attack on AES

open access: yesSymmetry, 2022
A Fault Attack (FA) is performed mainly under the data corruption model and poses a threat to security chips. Instruction corruption can enact the same purpose at the behavioral level, which is produced by interfering with the instruction system. Laser Fault Injection (LFI) on program memory during the instruction-fetching process, which we refer to as
Huilong Jiang, Xiang Zhu, Jianwei Han
exaly   +2 more sources

A Symbolic Intruder Model for Hash-Collision Attacks [PDF]

open access: yes, 2006
In the recent years, several practical methods have been published to compute collisions on some commonly used hash functions. In this paper we present a method to take into account, at the symbolic level, that an intruder actively attacking a protocol ...
Chevalier, Yannick, Kourjieh, Mounira
core   +5 more sources

Improved Collision Attack on Hash Function MD5 [PDF]

open access: yesJournal of Computer Science and Technology, 2007
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that was presented by Wang et al. in the Conference EUROCRYPT 2005. We found that the derived conditions for the desired collision differential path were not sufficient to ...
Jie Liang, Xuejia Lai
exaly   +3 more sources

Algebraic Collision Attacks on Keccak

open access: yesIACR Transactions on Symmetric Cryptology, 2021
In this paper, we analyze the collision resistance of the two smallest versions of Keccak which have a width of 200 and 400 bits respectively. We show that algebraic and linearization techniques can serve collision cryptanalysis by using some interesting properties of the linear part of the round function of Keccak.
Heim Boissier, Rachelle   +2 more
openaire   +5 more sources

Collision Based Attacks in Practice [PDF]

open access: yes2015 Euromicro Conference on Digital System Design, 2015
Chosen-Message Simple Power Analysis, also called Collision Based Attacks (CBA), have been proposed by Fouque, Yen and Homma. These attacks aim at inducing and detecting collisions during modular operations. However, detecting collisions is a challenging task in real environments. Doing it in an automated manner is even more challenging. In this paper,
Diop, Ibrahima   +3 more
openaire   +2 more sources

Automating Collision Attacks on RIPEMD-160

open access: yesIACR Transactions on Symmetric Cryptology, 2023
As an ISO/IEC standard, the hash function RIPEMD-160 has been used to generate the Bitcoin address with SHA-256. However, due to the complex doublebranch structure of RIPEMD-160, the best collision attack only reaches 36 out of 80 steps of RIPEMD-160, and the best semi-free-start (SFS) collision attack only reaches 40 steps.
Li, Yingxin, Liu, Fukang, Wang, Gaoli
openaire   +4 more sources

Fake Near Collisions Attacks

open access: yesIACR Transactions on Symmetric Cryptology, 2020
Fast Near collision attacks on the stream ciphers Grain v1 and A5/1 were presented at Eurocrypt 2018 and Asiacrypt 2019 respectively. They use the fact that the entire internal state can be split into two parts so that the second part can be recovered from the first one which can be found using the keystream prefix and some guesses of the key materials.
Patrick Derbez   +2 more
openaire   +6 more sources

Collision attack on reduced-round Camellia [PDF]

open access: yesScience in China Series F, 2005
Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between 4-round Camellia and a random permutation of the blocks space. By using collision-searching techniques, the distinguishers are used to attack on 6, 7, 8 and 9 rounds of Camellia with 128-bit key and 8, 9 and 10 rounds of ...
Wenling Wu, Dengguo Feng
openaire   +2 more sources

Optimal Collision Side-Channel Attacks [PDF]

open access: yes, 2020
Collision side-channel attacks are effective attacks against cryptographic implementations, however, optimality and efficiency of collision side-channel attacks is an open question. In this paper, we show that collision side-channel attacks can be derived using maximum likelihood principle when the distribution of the values of the leakage function is ...
Cezary Glowacz, Vincent Grosso
openaire   +2 more sources

Home - About - Disclaimer - Privacy