Re:There are no good constant-time data structures
by tedunangst on Tuesday December 02, 2014 @09:22PM
(#8691524)
Write a password library that uses bcrypt. Compare hashes with strcmp. Put it on the internet. See what happens. :)
[ Parent
| on HN ]
Re:There are no good constant-time data structures
by thirsteh on Tuesday December 02, 2014 @09:55PM
(#8691640)
That (using ==) is what py-bcrypt does, written by Damien Miller, a fairly well-known OpenSSH and OpenBSD hacker. It has definitely attracted some "smart" comments from "experts," as does anything that uses == in a security setting, no matter the actual context.
Sure, it's usually poignant critique, but anyone who actually knows anything about this subject agrees that doing a non-constant-time-compare on what is essentially a random oracle leaks nothing of value to an attacker, and people are just parroting a catch phrase without understanding it. It's the evolution of the fan favorite "That's security through obscurity!" applied outside cryptography.
Re:There are no good constant-time data structures
by tedunangst on Tuesday December 02, 2014 @10:04PM
(#8691670)
Who do you think told me what happens? :)
Re:There are no good constant-time data structures
by thirsteh on Tuesday December 02, 2014 @10:05PM
(#8691674)
Perfect. Small world.
Re:There are no good constant-time data structures
by dmpk2k on Tuesday December 02, 2014 @09:54PM
(#8691631)
That doesn't tell me anything. :/
As far as I can tell, you're implying an attacker can determine a password using timing of hash comparisons. How is this any different (just more complicated) than a regular brute force attack?
Re:There are no good constant-time data structures
by Gurkenmaster on Wednesday December 03, 2014 @06:08AM
(#8693025)
strcmp will stop at the end of the string. (the first zero or \0)
Comparing the hashes ABC\0DEF and ABC\0XYZ will result true. There are a lot of hashcollisions which make finding a password a lot easier but the password won't work with sites that don't use strcmp.