New Second-Preimage Attacks on Hash Functions

Key words: Herding attack, Second preimage attack, Trojan message attack, Zipper hash, Concatenated hash, Tree hash..

More precisely, the security of any cancelable biometric process re- quires the associated transformation to be non invert- ible: it means that it should be hard for an intruder

Previous and new results on SHA-1 and BLAKE(2). The first preimage attacks on SHA-1 were due to De Cannière and Rechberger [6], who used a system-based approach that in

Although users in buckets with large amounts of training data do benefit more from the personalized classifier (up- to 65% reduction in spam), even users that did not contribute to

siderations: (a) it can be easier to infer a generalized, inter- pretable representation (e.g., binary hascode) of a response (along with the inverse mapping) instead of a

[4] propose another technique based on a variant of the Shallue-Woestijne-Ulas (SWU) function, and explain how to construct secure hash functions to elliptic curves based on

We describe an integral attack on 21 rounds of the inner block cipher of Lesamnta using a cancellation property, and a new truncated differential for SMS4.. The paper is organized

The work needed for these attacks depends on the number of intermediate hash values of the target message, as this determines the work needed to find a linking message from