Results 191 to 200 of about 1,630,039 (238)

Collision attack on NaSHA-384/512

2010 International Conference on Networking and Information Technology, 2010
NaSHA 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

2021
At 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, Jialiang Hua, Lei Hu, Xiaoyang Dong, Zheng Li, Xiaoyun Wang   +5 more
openaire   +2 more sources

A Meaningful MD5 Hash Collision Attack

, 2014
It is now proved by Wang et al., that MD5 hash is no more secure, after they proposed an attack that would generate two different messages that gives the same MD5 sum. Many conditions need to be satisfied to attain this collision.
Sjsu Scholarworks, N. Kashyap
semanticscholar   +1 more source

An Improved Collision Attack on MD5 Algorithm

2008
The 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

MitM Attack by Name Collision: Cause Analysis and Vulnerability Assessment in the New gTLD Era

IEEE Symposium on Security and Privacy, 2016
Recently, Man in the Middle (MitM) attacks on web browsing have become easier than they have ever been before because of a problem called "Name Collision" and a protocol called the Web Proxy Auto-Discovery (WPAD) protocol.
Qi Alfred Chen, E. Osterweil, Matthew Thomas, Z. Morley Mao   +3 more
semanticscholar   +1 more source

Near Collision Attack Against Grain V1

International Conference on Applied Cryptography and Network Security, 2023
S. Banik, Daniel Collins, W. Meier
semanticscholar   +1 more source

Implementation of MD5 Collision Attack in Program

2019
Md5 [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, Yanbin Sun, Mohan Li, Xiaohan Helu, Yuying Li   +4 more
openaire   +2 more sources

Near and Far Collision Attack on Masked AES

2020
Collision 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, Qingping Tang, Xiaoya Yang, Yaoling Ding, Jiawei Zhang, Yongchuan Niu   +5 more
openaire   +2 more sources

Algebraic Methods in Side-Channel Collision Attacks and Practical Collision Detection

2008
This 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, Ilya Kizhvatov, Andrey Pyshkin   +2 more
openaire   +2 more sources

Bit-Free Collision: Application to APOP Attack

2009
This paper proposes a new variant of collisions on hash functions named bit-free collision , which can be applied to reduce the number of chosen challenges in password recovery attacks on hash-based challenge and response protocols, such as APOP (Authentication Post Office Protocol).
Yu Sasaki, Kazuo Sakiyama, Lei Wang, Kazuo Ohta   +3 more
openaire   +2 more sources