Re: Theoretical limits for password length

From: Paul Rubin (//phr.cx_at_NOSPAM.invalid)
Date: 08/27/05 

Date: 27 Aug 2005 12:16:13 -0700

"Milan VXdgsvt" <milan_vxdgsvt@seznam.cz> 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".