Date: Thu, 28 Jan 2010 16:24:43 -0500 From: Roger <rnodal@gmail.com> To: freebsd-security@freebsd.org Subject: Re: PHK's MD5 might not be slow enough anymore Message-ID: <9d972bed1001281324r29b4b93bw9ec5bc522d0e2764@mail.gmail.com> In-Reply-To: <20100128182413.GI892@noncombatant.org> References: <20100128182413.GI892@noncombatant.org>
next in thread | previous in thread | raw e-mail | index | archive | help
What would be the consequence of having an algorithm that will increase the amount of time needed to check the next password after a failure. In other words, check the first one fast, the second try it will be slower, then the third even slower and then the forth even slower etc. Is this how it is currently implemented? (Sorry I did not read the code). -r
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?9d972bed1001281324r29b4b93bw9ec5bc522d0e2764>