EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Handbook of Applied Cryptography
Handbook of Applied Cryptography
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
Differential Collisions in SHA-0
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Information Processing Letters
Optimal hash functions for approximate matches on the n-cube
IEEE Transactions on Information Theory
Optimal covering codes for finding near-collisions
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Memoryless near-collisions via coding theory
Designs, Codes and Cryptography
Exploiting coding theory for collision attacks on SHA-1
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Improved sphere bounds on the covering radius of codes
IEEE Transactions on Information Theory
An improvement of the Van Wee bound for binary linear covering codes
IEEE Transactions on Information Theory
| Hi-index | 0.89 |
In this paper we discuss the problem of generically finding near-collisions for cryptographic hash functions in a memoryless way. A common approach is to truncate several output bits of the hash function and to look for collisions of this modified function. In two recent papers, an enhancement to this approach was introduced which is based on classical cycle-finding techniques and covering codes. This paper investigates two aspects of the problem of memoryless near-collisions. Firstly, we give a full treatment of the trade-off between the number of truncated bits and the success-probability of the truncation based approach. Secondly, we demonstrate the limits of cycle-finding methods for finding near-collisions by showing that, opposed to the collision case, a memoryless variant cannot match the query-complexity of the ''memory-full'' birthday-like near-collision finding method.