im calling modular arithmetic
-
-
-
specifically the part where you have to pad with zeros: for example, https://github.com/ajalt/python-sha1/blob/master/sha1.py#L130 …
-
ya, not at computer atm but 55 + 8 for length + 1 = 64, I'd guess I'm padding more when I shouldn't be
-
since I did the lazy thing and appended 0x80 rather than going to bit granularity
-
I think most implementations do that, which is fine as long as you're only hashing complete bytes; but the +1 is tricky
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.