Results 281 to 290 of about 133,184 (295)
Some of the next articles are maybe not open access.
Improved Collision Attacks on MD4 and MD5
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2007At Eurocrypt'05, Wang et al. presented efficient collision attacks on MD5 and MD4 hash functions. They found a collision of MD5 with a complexity of less than 237 MD5 hash operations, and a collision of MD4 with complexity less than 28 MD4 hash operations. In their attack, the procedure to generate a collision is divided into 4 steps.
Noboru Kunihiro +3 more
openaire +2 more sources
Related-Key Collision Attack of AES_256
2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010This paper utilized the arrangement points of AES_256 key, analyzed the difference features of AES_256, and found a method of collision attack. This paper also made use of connection differential features and collision method of AES_256 to analyze the 72 bytes of the initial key of AES_256, with a complexity of 2128.
Zhihua Hu, Zhongping Qin
openaire +2 more sources
Collision attack on NaSHA-384/512
2010 International Conference on Networking and Information Technology, 2010NaSHA is a family of hash functions submitted by Markovski and Mileva, it is accepted as one of the first SHA-3 round candidates. In this paper, we present a collision attack on NaSHA for the output sizes 384-bit and 512-bit. This attack is based on the the weakness in the generate course of the state words, and the fact that the quasigroup operation ...
Hongan Jiang, Zhimin Li, Cunhua Li
openaire +2 more sources
Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks
2021At EUROCRYPT 2021, Bao et al. proposed an automatic method for systematically exploring the configuration space of meet-in-the-middle (MITM) preimage attacks. We further extend it into a constraint-based framework for finding exploitable MITM characteristics in the context of key-recovery and collision attacks by taking the subtle peculiarities of both
Siwei Sun +5 more
openaire +2 more sources
An Improved Collision Attack on MD5 Algorithm
2008The research on the attack algorithm for a MD5 collision is one of the focuses in cryptology nowadays. In this paper, by analyzing the properties of the nonlinear Boolean functions used in MD5 and the differences in term of XOR and subtraction modulo 232, we prove that some sufficient conditions presented by Jie Liang and Xuejia Lai are also necessary ...
Chenhui Jin, Shiwei Chen
openaire +2 more sources
Collision Attack on the Full Extended MD4 and Pseudo-Preimage Attack on RIPEMD
Journal of Computer Science and Technology, 2013The cryptographic hash functions Extended MD4 and RIPEMD are double-branch hash functions, which consist of two parallel branches. Extended MD4 was proposed by Rivest in 1990, and RIPEMD was devised in the framework of the RIPE project (RACE Integrity Primitives Evaluation, 1988 ~ 1992).
Gaoli Wang, Gaoli Wang
openaire +2 more sources
Implementation of MD5 Collision Attack in Program
2019Md5 [1] has been widely used because of its irreversibility, but its security is also questionable. Since Professor Wang [2] pointed out that MD5 is unsafe, Md5 collision and various attack algorithms began to appear and were used in large quantities. In the paper of Bai Honghuan’s MD5 fast collision algorithm [3], the characteristics of MD5 collision ...
Le Wang +4 more
openaire +2 more sources
Efficient Collision Attack Frameworks for RIPEMD-160
2019RIPEMD-160 is an ISO/IEC standard and has been applied to generate the Bitcoin address with SHA-256. Due to the complex dual-stream structure, the first collision attack on reduced RIPEMD-160 presented by Liu, Mendel and Wang at Asiacrypt 2017 only reaches 30 steps, having a time complexity of \(2^{70}\).
Florian Mendel +8 more
openaire +3 more sources
Near and Far Collision Attack on Masked AES
2020Collision attack is an effective method in the field of side-channel analysis to crack cryptographic algorithms, and masking can be used as a countermeasure. Most collision attacks only utilize the traces that will collide. In this paper, we propose a collision attack method that exploits not only traces tending to collide, but also non-colliding ...
An Wang +5 more
openaire +2 more sources
Algebraic Methods in Side-Channel Collision Attacks and Practical Collision Detection
2008This paper presents algebraic collision attacks, a new powerful cryptanalytic method based on side-channel leakage which allows for low measurement counts needed for a successful key recovery in case of AES. As opposed to many other side-channel attacks, these techniques are essentially based on the internal structure of the attacked cryptographic ...
Andrey Bogdanov +2 more
openaire +2 more sources