Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
A question I’ve been meaning to have answered for a long time – What would be the time complexity of finding an MD5sum of a compiled binary that contains that same MD5 statically embedded in it, say, as a string?
Edit: If this wasn’t already clear. I am looking for an answer with the time complexity and an explanation of it.
Pretty much the same as brute force: computing a md5sum is trivial, but making a file to match a known md5sum is hard.
You are, in the best case, looking for a preimage that will give you a known hash (possibly by adding data into the binary).