Date: Thu, 28 Jan 2010 17:18:25 -0500 From: Garance A Drosihn <drosih@rpi.edu> To: d@delphij.net, freebsd-security@freebsd.org Subject: Re: PHK's MD5 might not be slow enough anymore Message-ID: <p0624080ac787bc084b52@[128.113.24.47]> In-Reply-To: <p06240808c787b7763922@[128.113.24.47]> References: <20100128182413.GI892@noncombatant.org> <20100128135410.7b6fe154.wmoran@collaborativefusion.com> <20100128193941.GK892@noncombatant.org> <20100128151026.5738b6c1.wmoran@collaborativefusion.com> <20100128201857.GP892@noncombatant.org> <4B61FCFF.6040207@delphij.net> <p06240808c787b7763922@[128.113.24.47]>
index | next in thread | previous in thread | raw e-mail
At 4:56 PM -0500 1/28/10, Garance A Drosihn wrote: >At 1:09 PM -0800 1/28/10, Xin LI wrote: >>-----BEGIN PGP SIGNED MESSAGE----- >>Hash: SHA1 >> >>On 2010/01/28 12:18, Chris Palmer wrote: >>> For backwards compatibility, which do people prefer: Creating a new $N$ >>> prefix every time we re-tune the algorithm, or using a new notation to say >>> how many times this password was hashed? For example: $1.1000$, $1.100000$, >>> et c.? >> >>I'd vote for $1.nnnn$, as a good side effect it would be tunable by the >>administrators who want to fine tune the round number as need. > >Might want to make it something like $1.nnn.bbb$, so the admin can specify >the number of bits as well as the number of rounds. And then pick some >algorithm where those two values make sense. :-) > > >By going for something tunable, users don't HAVE to change their password >the moment the sysadmin decides that it's time for better protection. The >sysadmin can change the numbers used when the user changes their password, >and then gradually transition everyone to the stronger encryption. > >It also means that users could decide to use stronger encryption if they >are willing to wait for it, without the sysadmin needing to do anything. Also note that we might not want the "nnn" number to be an exact count of the number of times it was hashed. For instance, it might be that the algorithm works best if the number is always hashed a prime-number of times, or that it's always a power-of-2 increase. So a value of 3 for "nnn" just means "more times than 2 would do", and not necessarily "exactly one more time than would be done for 2". This is just meant as something we might want to consider. -- Garance Alistair Drosehn = gad@gilead.netel.rpi.edu Senior Systems Programmer or gad@freebsd.org Rensselaer Polytechnic Institute or drosih@rpi.eduhelp
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?p0624080ac787bc084b52>