4 ms·

Any hashing algorithm can be made slower by stretching (repeatedly running the algorithm), so speed on its own is kind of meaningless Ideally you want algorith

Any hashing algorithm can be made slower by stretching (repeatedly running the algorithm), so speed on its own is kind of meaningless Ideally you want algorithms that are hard to design custom hardware for, or in other words, are very efficient on general purpose hardware (CPU/GPU). You can then stretch the algorithm to take 200ms on your server without it being doable in nanoseconds by dedicated hardware I'm not entirely sure what "too slow for its memory usage means", but I would guess that it doesn't use enough memory which means ASICs/FPGAs are relatively easier to make for it

tromp 12y ago
"Too slow for its memory usage" means that that in order to use large amounts of memory, it becomes impractically slow. One of the non-finalists (Centrifuge) was criticised for byte-grained random memory accesses. A random access to main memory causes a row activation delay of roughly 50ns, so one should access many nearby bytes to make up for that.
- chowells 12y ago
  That slows it down on general-purpose CPUs, but not on special-purpose ASICs. That's the exact opposite of what's desired.