The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Differential Collisions in SHA-0
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Information Processing Letters
On Free-Start Collisions and Collisions for TIB3
ISC '09 Proceedings of the 12th International Conference on Information Security
Collisions for 70-step SHA-1: on the full cost of collision search
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
Optimal hash functions for approximate matches on the n-cube
IEEE Transactions on Information Theory
Finding SHA-1 characteristics: general results and applications
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Exploiting coding theory for collision attacks on SHA-1
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Memoryless near-collisions, revisited
Information Processing Letters
| Hi-index | 0.00 |
Recently, a new generic method to find near-collisions for cryptographic hash functions in a memoryless way has been proposed. This method is based on classical cycle-finding techniques and covering codes. This paper contributes to the coding theory aspect of this method by giving the optimal solution to a problem which arises when constructing a suitable code as the direct sum of Hamming and trivial codes.