Author | Post | ||
unime![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
According to Wikipedia, the only practical collision construction method demonstrated so far requires "a template file, with a 128-byte block of data aligned on a 64-byte boundary, that can be changed freely by the collision-finding algorithm." I take this to mean that you need the plaintext to generate a collision. I don't see how it will help. |
||
![]() |
|
||
chameleon![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
collisions have nothing to do with this thread collisions are just useful if for example a website stores only the md5 hash of a password so if you login the script just looks if the md5 hash is the same as the hash of the entered password if you can't get the word through dictonary or bf attack it is possible to create a collision this is most likely a string with all possible ascii characters and not a word but it can be used to login but the goal of this challenge is to get a certain word so collisions are useless |
||
Edited by chameleon on 26.10.2005 16:26:22 | |||
![]() |
|
||
mxn![]() ![]() ![]() ![]() |
finding collisions is way easier than finding the string corresponding to a hash - have a look at http://en.wikipedia.org/wiki/Birthday_Problem |
||
![]() |
|
||
chameleon![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
maybe it is easier but who cares??? the goal of the planned challenge is to get a specific word so get away with your collisions ;p |
||
![]() |
|
||
mxn![]() ![]() ![]() ![]() |
I didnt start with collisions, i just wanted to clarify that it doesnt help with the topic ![]() |
||
![]() |
|