are there other md5 reverse methods except dictionary (either bf or a big db where alot of combiinations are listed up) and brute force?

chameleon: That's only true if he is not hashing it multiple times. Else all the resulting hashes need to be in the dictionary too.

bb

bb, I think chamaleon means that:

Hash = MD5(MD5(MD5(MD5(MD5("<dictionary_word>")))));

can be BF'ed, by a custom program, of course.

Ok what i was doing it for, see if you can tell me what this md5 string means. its not a word its a group of letters.

aa3e9927d5058c962b83500ad79588b3

Int3rface

yes phas that is what i meant



just lowercase letters? this would require a bruteforce attack... could only be done with 1-7 letters
8 letters and more would take too much time

well what it is, i encypted a word in base 64. so it came out like, YuIJhg= then i just made that and md5 string. I was wondering if it was possible to decrypt the md5 string.

Int3rface

the more the user knows about the method the easier is it to gain the word

but like everybody in this thread already said: it is impossible to reverse a md5 hash

so there are just 2 possible ways to get a hashed word:
dictonary attack (try out all words in a list)
bruteforce (if the word is short (max 8 letters a-z))

if you gave me this hash i would try those 2 methods and then i would think that the hash is unbreakable
so you said that it is hashed 5 times
again i would try those 2 methods and see that there is no word which is in the dictonary
i would not try to bruteforce all ASCII letters (so not all base64 letters)

if you say that you used a base64 encoding and hashed it 5 times then i would try those two methods
etc...

so it is only possible if i know the method and the word is in a dictonary or short
only a little variation can be guessed (like hashed 2 times, or first base64 and then hashed one time)

so it depends on how much information you give the user

but then, how to solve the Md5 level on "MiB-Challenges" ... tbs has added the url some weeks ago i think ..

thankyou chamelion.
It was the word james encrypted once in base 64. and then the base 64 encrypted once with md5.

int3rface

I didn't read through the entire thread so if this information is already in there though luck

There have been "recent" advances in this field allowing you to find a collision for a certain md5
in a reasonable time. you can search google for more documents.

however what i read was very mathematical, and i didn't see anything happening after this development. Probably because normal bruteforce. rainbowtables, and dictionary attacks are usually sufficient