Home.... | log in.... | Pub my question! | Sign-up....
Java-index >> Other Topics >> Algorithms

MD5

Hey i know MD5 isn't reverseable , but it's not because of the logic that :3+5=8 and so does 2+6 , 1+7 , 4+4 so you cant take 8 back to 3 and 5 but is it possible to not "unhash" but rather get and array of possiblities from running the code backwards ish
[292 byte] By [TheEpicSnaila] at [2007-10-1 1:33:23]
«« Urgent - can't set managed bean value using a form, getting null
»» Floating point illustration program
# 1

Depends what you mean by "possible". The usual phrase used in this sort of situation is "In principle you could...", which means something like "You could produce an list of 10^100 different possibilities and examine each entry..."

So yes, it's mathematically possible but not practically possible.

DrClapa at 2007-7-8 1:53:48 > top of Java-index,Other Topics,Algorithms...
# 2
If you have a smallish number of possible input values, it would not be "computationally infeasable" to do a brute-force search of them and reverse the hash.
Adeodatusa at 2007-7-8 1:53:48 > top of Java-index,Other Topics,Algorithms...
# 3
Who said that? It's perfectly reversible for some input values, and if you just need to create some string that would have the same hash as original it's by definition possible too.Actually SHA1 has some problems too.
Lord_of_the_chaosa at 2007-7-8 1:53:48 > top of Java-index,Other Topics,Algorithms...
# 4
> It's perfectly reversible for some input values.And imperfectly reversible for all the others?> Who said that?Who said what?
Adeodatusa at 2007-7-8 1:53:48 > top of Java-index,Other Topics,Algorithms...
Other Topics
Algorithms

Other Topics New Topic

Other Topics Hot Topic

Other Topics

All Classified