Chosen-Prefix Collisions on AES-like Hashing
Chosen-prefix collision (CPC) attack was first presented by Stevens, Lenstra and de Weger on MD5 at Eurocrypt 2007. A CPC attack finds a collision for any two chosen prefixes, which is a stronger variant of collision attack. CPCs are naturally harder to construct but have larger practical impact th...
Saved in:
Main Authors: | Shiyao Chen, Xiaoyang Dong, Jian Guo, Tianyu Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2024-12-01
|
Series: | IACR Transactions on Symmetric Cryptology |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/ToSC/article/view/11951 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Statistical ineffective fault analysis of the lightweight authenticated cipher algorithm Saturnin-Short
by: Wei LI, et al.
Published: (2023-04-01) -
Preimage attacks on reduced‐round Keccak hash functions by solving algebraic systems
by: Junling Pei, et al.
Published: (2023-05-01) -
Analysis of the amplitude form of the quantum hash function
by: M. F. Ablayev, et al.
Published: (2023-11-01) -
Preimage and pseudo collision attacks on round-reduced DHA-256 hash function
by: Jian ZOU, et al.
Published: (2013-06-01) -
Preimage and pseudo-collision attacks on 29-step SM3 hash function with padding
by: Gao-li WANG, et al.
Published: (2014-02-01)