also the C implementation of AES is crappy best-effort constant-time whereas the SSE2 impl. is real constant-time.
Only if you have bad data structures that are "O(log n) typical" or "O(1) typical" but really O(n) or O(n²).
-
-
even a full binary search tree with a 32-bit fixed key suffers from cache effects
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.