[Cryptography] Introducing the world's worst hash function
Kent Borg
kentborg at borg.org
Tue Jan 29 12:46:26 EST 2019
On 1/29/19 11:22 AM, Jerry Leichter wrote:
> An interesting bit of history: VMS needed a way to introduce short delays at certain points (especially in drivers). The clock's resolution was way too coarse for this purpose; what was needed was a delay loop. But since VMS would run on a variety of processors - including processors that might not exist when the code was compiled - it needed to adjust dynamically.
I remember that, but I am not sure from where. Did Linux or Sun Unix
once do something similar??
As for ugly patching, a linker is quite dynamic yet acceptable these
days. For delays bigger than a subroutine call it seems that a little
bit of dynamic in just one place could then be merely linked to. But
then modern caching makes most inherent timing so non-deterministic.
-kb, the Kent, who on seeing the merdeMerdeHash() code in almost
compilable C, wonders what it would look like in Rust.
More information about the cryptography
mailing list