in reply to Hashes aren't being differently randomized
algorithm complexity attack only means you'll not get hash slowness because all hash items felt into same bucket so extracting hash element will be O(N), instead of O(log(N))
However the moral is - you must not pretend that keys order is same between runs (so some programs probably stopped working when hash randomization was introduced)
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Hashes aren't being differently randomized
by shmem (Chancellor) on Jun 26, 2006 at 18:15 UTC | |
by vkon (Curate) on Jun 26, 2006 at 18:44 UTC | |
by shmem (Chancellor) on Jun 26, 2006 at 18:46 UTC | |
|
Re^2: Hashes aren't being differently randomized
by tye (Sage) on Jun 27, 2006 at 06:39 UTC | |
by Hue-Bond (Priest) on Jun 27, 2006 at 14:41 UTC | |
by tye (Sage) on Jun 27, 2006 at 22:07 UTC | |
by tye (Sage) on Jun 27, 2006 at 21:35 UTC |