Security Analysis: Adversary's Ability to Recover Concatenated and Hashed Secret with Partial String Knowledge

Asked Sep 16 '23 at 11:20

Active Sep 16 '23 at 11:20

Viewed 34 times

Suppose I have the following secret, calculated by concatenating and hashing the results of two random strings:

secret = H( H( random_string1 ) || H( random_string2 ) )

Let's assume that the adversary knows one of these strings but not the other. In this case, can the adversary recover the secret in a practical manner?

Assume that H is a secure hash function like SHA-256.

asked Sep 16 '23 at 11:20

Kadir Korkmaz

Look into prefix MAC and suffix MAC. That's essentially what you're describing, just you're hashing the key and message. – samuel-lucas6 Sep 16 '23 at 11:38

Security Analysis: Adversary's Ability to Recover Concatenated and Hashed Secret with Partial String Knowledge

0 Answers0