Unavoidable regularities in long words with bounded number of symbol occurrences
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Increasing the flexibility of the herding attack
Information Processing Letters
Provable chosen-target-forced-midfix preimage resistance
SAC'11 Proceedings of the 18th international conference on Selected Areas in Cryptography
Cryptanalyses on a merkle-damgård based MAC -- almost universal forgery and distinguishing-h attacks
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
On the complexity of the herding attack and some related attacks on hash functions
Designs, Codes and Cryptography
Unavoidable regularities in long words with bounded number of symbol occurrences
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
In this paper we present new attack techniques to analyze the structure of hash functions that are not based on the classical Merkle-Damgård construction. We extend the herding attack to concatenated hashes, and to certain hash functions that process each message block several times. Using this technique, we show a second preimage attack on the folklore "hash-twice" construction which process two concatenated copies of the message. We follow with showing how to apply the herding attack to tree hashes. Finally, we present a new type of attack -- the trojan message attack, which allows for producing second preimages of unknown messages (from a small known space) when they are appended with a fixed suffix.