01-26-2012, 09:37 PM
I was afraid it might take just as long to check length as to generate the hash for fast algorithms.
I can't think of a simple way to implement such a feature w/o checking the candidate length just before computing the hash. Any other way I can think of would be complicated to explain to users.
I can't think of a simple way to implement such a feature w/o checking the candidate length just before computing the hash. Any other way I can think of would be complicated to explain to users.