+- hashcat Forum (https://hashcat.net/forum)
+-- Forum: Misc (https://hashcat.net/forum/forum-15.html)
+--- Forum: General Talk (https://hashcat.net/forum/forum-33.html)
+--- Thread: Is this possible? (/thread-6034.html)
Is this possible? - chickin - 11-12-2016
function udb_hash($buf) {
$length=strlen($buf);
$s1 = 1;
$s2 = 0;
for($n=0; $n<$length; $n++)
{
$s1 = $s1 + ord($buf[$n]) % 65521;
$s2 = $s2 + $s1 % 65521;
}
return ($s2 << 16) + $s1;
}
Is it possible to crack a hash with this algorithm since it isn't implemented with hashcat? Or would I need to make a request?
RE: Is this possible? - bigblacknose - 11-12-2016
Can't you just try to write a poc i Perl or something to see how fast that is? Often these small problem can be solved without GPU support. Or have you already given up on CPU?
RE: Is this possible? - chickin - 11-13-2016
(11-12-2016, 11:25 PM)bigblacknose Wrote: Can't you just try to write a poc i Perl or something to see how fast that is? Often these small problem can be solved without GPU support. Or have you already given up on CPU?
I'm not the best with this kind of thing, this algorithm is like a split off of adler32, but i'm not really sure where to start
RE: Is this possible? - atom - 11-13-2016
https://hashcat.net/wiki/doku.php?id=frequently_asked_questions#i_want_to_request_some_new_algorithms_or_features_how_can_i_accomplish_this
RE: Is this possible? - chickin - 11-13-2016
Alright, thanks.