Re:Binary Search: A new implementation that is up to 25% faster
by rurban on Monday July 20, 2020 @12:55PM
(#23899652)
With possible timing attacks you usually do a full linear search, without early return. This search has always constant time, twice as slow. When the attacker gets to know the seed somehow even hashmaps can be exploited.
[ Parent
| on HN ]
There are no comments on this comment yet.