Orchid XP v7 wrote:

> I'm mainly trying to implement it in Haskell for fun; it'll probably go 
> too slow to be useful. (But we'll see about that...)

Oh my *God*, I've just spent my entire evening trying to make this damn 
thing work! I was thwarted by the following:

- I mis-typed certain magic numbers, causing the output to be a few 
digits wrong. >_<

- I forget the final state-add step. I spent literally *ages* trying to 
figure out why all the output was correct up until the very last stage.

- The hash is little-endian. Damn thing! I actually had the right 
output, it just looked wrong because you have to turn it half-backwards 
according to the dumb RFC. *sigh*

So yays! My program now correctly hashes the 0-byte string to yield an 
MD5 hash of D41D8CD98F00B204E9800998ECF8427E.

Now all I need to do is implement the very fiddly bit-padding algorithm 
and I'm golden...

It's TF2 time!

Post a reply to this message