Can anyone shed some light into SHA-256 and RIPEMD-160, which algorithm is normally faster and what are the performance and space comparisons, if any? By space comparisons I don't mean 160 bits and 256 bits, but what are the collisions frequency, difference in space requirements in production env. and time to calculate both. Is RIPEMD-16...
everything i have tried has given me wrong output values. i even copied C codes and changed them so that they would work in python and i still get wrong outputs. what is wrong? import os, math def makehex(value,size=8): value = hex(value)[2:] if value[-1] == 'L': value = value[0:-1] while len(value)<size: va...
assuming that everything else (functions, constants, etc) are correct, is this a correct main loop of ripemd160? for j in range(80): T = (a+ ROL( (F(b, c, d, j) + X[r[j]] + k[j/16])%2**32,s[j])+e)%2**32 a = e; e = d; d = ROL(c, 10); c = b; a = T # parallel round T = (aa+ ROL( (F(bb,cc,dd,79-j) + X[rr[j]] + kk[j/16] )%2**32...
i know ive asked similar questions like this before, but: Is this pseudocode here the same as my code? upper case variables are the variables in the pseudocode with " ' " and the values with conditions are all in lists, such as: all "s" conditions are in list "s", and " s' " conditions in list "S" for i in xrange(t): a = h0; b = h1;...