Re:Algorithmic complexity attacks and libc qsort()
by gsnedders on Wednesday June 11, 2014 @10:46PM
(#7881555)
Considering the fact that timing attacks based on memcmp short circuiting were shown to be remotely practical a decade ago, latency isn't going to be an issue. The bigger question is whether you can get down your inputs to a small enough number to practically determine PRNG state (you probably can).
[ Parent
| on HN ]
There are no comments on this comment yet.