Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Say I have a string that I want to keep hidden. You can then enter a known string which is added to the end of the hidden string and you are given the sha256 hash of the combined string. If you were to do this many times with whatever strings you wanted and the hidden string remained fixed, would there be a practical way to determine the hidden string?

share|improve this question
If this is motivated by a homework question asking about the security of H(K|M) as a MAC (for hash function H, key K, and message M), you should consider the possibility that an attacker may not need to learn K in order to produce a forgery. Think about how SHA256 works internally. –  Seth May 22 '14 at 17:22
How much entropy does the hidden string have? What have you tried? Are you familiar with the random oracle model? Have you tried figuring out what answer you'd get in the random oracle model? For that matter, what have you tried? Please edit the question to show your work. –  D.W. May 22 '14 at 21:52

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.