1
$\begingroup$

So I have a partial input data (string) PART1+UNKNOWN+PART2, length of UNKNOWN is self-describing. I have a bunch of valid hashes (about 8 or so) that are compatible.

My question is then: will bruteforce search for full collision given the data at hand be as long?

Improve this question
$\endgroup$
1
  • $\begingroup$ Are you really asking for the collisions or finding the pre-images so that once can find the unknown part? $\endgroup$
    – kelalaka
    Apr 6, 2021 at 16:58

1 Answer 1

Reset to default
0
$\begingroup$

Yes, but please note that the question/answers you are pointing to are about partial collisions on the output, not partial input. Finding a full hash collision is not computationally feasible for hash functions that are considered secure, such as SHA-256.

Improve this answer
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.