The title is pretty descriptive of my question. As an example, say I use the MD5 hash function to create a hash key of the word "hello": 5d41402abc4b2a76b9719d911017c592.
There are two questions I would like to have answered:
- How difficult would it be to calculate any new string that would hash to the same key as "hello"?
and
- How difficult would it be to calculate a particular new string that would hash to the same key as "hello"?
