Given a hash cipher f(sha1($pepper . $plaintext))
where
- f is some transformation to an 11-byte string
- pepper is 24 bytes long with a character space of 62 (and is not unique for a given plaintext)
- plaintext is known for a set of ciphertexts
Is it possible to determine what the pepper is?
sha1(pepper | plaintext | padding_1 | plaintext2 | padding_2)
, padding_1 is already there; see here in details, to mitigate use SHA3, Blake2b, or SHA-512/256. Why are you using SHA-1, which is already deprecated by NIST... $\endgroup$