2 distinct documents will be probabilistically extraordinary (nearly ensured), yet a 128 piece hash (like md5) can just help 2128 unique qualities. Since there exist hypothetically unending documents, there likewise exist two records that hash to a similar esteem.
Given the first record, finding a second unmistakable document that hashes to a similar esteem is known as a second preimage assault; ensuring against the age of second preimages in computationally tractable ways is dependably an intriguing issue in cryptography. og youtube mod download
You are right. On the off chance that you change 1 bit the MD5 hash is totally extraordinary. Be that as it may, MD5 has been viewed as broken for a long time now. Sha1 is semi broken (kinda) with Google discharging a proof of idea pdf with a ponder hash impact.