Is this possible?

[chickin]

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?

[bigblacknose]

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?

[chickin]

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

[atom]

https://hashcat.net/wiki/doku.php?id=fre...plish_this

[chickin]

Alright, thanks.