3 ms·
That's not difficult so I doubt it. For MD5 we have what's called a chosen prefix collision. Given a start of a file, you can get back two "next bits" of the f
by tialaramex 8y ago
That's not difficult so I doubt it.
For MD5 we have what's called a chosen prefix collision. Given a start of a file, you can get back two "next bits" of the file which are similar but slightly different, and both those files (the chosen prefix plus A or chosen prefix plus B) have the same MD5.
Then because this is an MD family hash you can add any fixed suffix whatsoever to both and still get the same MD5.
So you put A and B inside a part of the file that isn't visible but can influence a conditional test elsewhere. Then you use the conditional test to flow the two different outputs, all the rest of the file is the same.
Some day this will definitely be possible with SHA1 and almost certainly (though it could be decades away) SHA256 too.
SHA3 is different, despite the name, we might perhaps never find any way to collide it, and if we do it's not MD it's a sponge design, so you can't just add a suffix or the output diverges again.