Questions tagged [2nd-preimage-resistance]

Difficulty of finding another input string that hashes to the same value as a given string

7 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5
votes
0answers
194 views

Second preimage attack complexity when the digest is malleable

An attacker has a hash $h$ and a message $m$. He wants to find $m^\prime$ with the same length as $m$ which hashes to $h^\prime$. However, $m^\prime$ can only differ from $m$ in the 1 bits (i.e. ...
3
votes
1answer
89 views

Do hash functions for digital signatures need to be preimage resistant?

I understand that hash functions used for hashing a document or some data before signing it, needs to be collision resistant and 2nd pre-image resistance. Otherwise an adversary could "look" ...
2
votes
0answers
19 views

How to find k-way second preimages

For example: Assuming someone has found a second preimage for SHA-256. In other words, for SHA256(M1)=H, someone has found M2 which SHA256(M2)=H Now, is it possible to generate k-way second ...
1
vote
1answer
39 views

finding second pseudo preimage faster than brute force

As far as I know finding second preimage of a hash function is almost as hard as finding preimage. But I want to know that is there any way to finding second pseudo preimage faster than brute force? I ...
1
vote
0answers
44 views

Why is this attack complexity equal that exact number of bit operations?

in the this paper,section 3,autors attack hamsi-256. Im trying to make a parametrized version, so i need to understand how do they estimate the complexity of attack in bit operations,that reads as ...
0
votes
0answers
27 views

Is an HMAC based on a second-preimage resistant hash function always unforgeable?

If hash function is collision-resistant, then its associated HMAC is always unforgeable. But suppose that a hash function is only second-preimage resistant, not necessarily collision-resistant. Then ...
0
votes
0answers
35 views

(key) Target Collision Resistance (kTCR)?

The enhanced Target Collision Resistance (eTCR) game implies that an adversary is allowed to choose a target message $M$. Upon choosing this target message, the attacker learns the function $\mathcal{...