|
About ::
TODO ::
Blog ::
RSS ::
Old blog ::
Projects ::
GIT ::
Gallery ::
Notes
Wed, 01 Aug 2007
A hash.
#define f1(x,y,z) (z ^ (x & (y ^ z)))
__u32 W[80];
__u32 digest[5];
__u8 in[64];
for (i = 0; i < 20; i++) {
t = f1(b, c, d) + K1 + rol32(a, 5) + e + W[i];
e = d; d = c; c = rol32(b, 30); b = a; a = t;
}
I've started to think about how to solve this problem.I expect similar results to my one round Jenkins hash analysis or complete fail. You know where to find results - stay tuned. /devel/math/hash :: Link / Comments (0) Please solve this captcha to be allowed to post (need to reload in a minute): 87 * 75 Comments are closed for this story. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||