(not a crypto-guru) If you use a library function to do your SHA-1, you're doing it wrong. Pad out your test strings to a fixed length of 448 bits (assuming t

(not a crypto-guru) If you use a library function to do your SHA-1, you're doing it wrong. Pad out your test strings to a fixed length of 448 bits (assuming that the words in their dictionary allow this). Use a custom hashing algorithm that skips the "pre-processing" step by assuming a fixed length string and skips the for loop since it only needs to process one chunk. http://en.wikipedia.org/wiki/SHA_hash_functions#SHA-1_pseudocode http://en.wikipedia.org/wiki/SHA_hash_functions#SHA-1_pseudo...