Re: Theoretical limits for password length
From: Paul Rubin (//phr.cx_at_NOSPAM.invalid)
Date: 27 Aug 2005 12:16:13 -0700
"Milan VXdgsvt" <firstname.lastname@example.org> writes:
> So what you are saying is that a quantum computer still needs 2^(N/2)
> operations to invert a N-bit hash function?
That's the best known generic result. See "Grover's algorithm".