Can I find a specific SHA512 for an partially-known string?

I have a plain text string "I-like-drawwing", and this string has a SHA512 value, assume the SHA512 is "aabbcc". Then I show SHA512 "aabbcc" to my friend and say: "this is SHA512 for my string, and my string ended with 'ing', I bet \$20 that you don’t know my string".

I don't want loose, so I must find another string ended with "ing" and also has the same SHA512 "aabbcc", Can I find that string?

• You should clarify what exactly you mean by "aabbcc". Is it just an example? Because a SHA512 output is 512 bits, how exactly would you encode this to "aabbcc"? Encoding a 512 bit value to 6 alphabetic letters would likely create way more collisions. Apr 24, 2020 at 9:47
• If the question is "can we find two different strings that have common SHA512 hash values", the answer is "no" Apr 24, 2020 at 14:16

What you are describing is a second-preimage attack on SHA-512, and you will find it quite infeasible, requiring an expected $$2^{512}$$ hash computations.