Re: Theoretical limits for password length
From: Unruh (unruh-spam_at_physics.ubc.ca)
Date: 08/26/05
- Next message: tomstdenis_at_gmail.com: "Re: Nocona [Intel 64-bit cpu timing]"
- Previous message: Unruh: "Re: Theoretical limits for password length"
- In reply to: Milan VXdgsvt: "Re: Theoretical limits for password length"
- Next in thread: Milan VXdgsvt: "Re: Theoretical limits for password length"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 25 Aug 2005 23:37:57 GMT
"Milan VXdgsvt" <milan_vxdgsvt@seznam.cz> writes:
>Paul Rubin wrote:
>> Also Merkle hash trees. Quantum computers just give a sqrt(f(N))
>> speedup for search problems where f(N) is the running time with a
>> conventional computer. They're not NP oracles.
>So that's what I don't get. I always thought a quantum computer can run
>2^N computations in parallel, test the result, and recall the original
>value that lead to the desired result.
No. You have been misled by b ad popular accounts
>If what you say is true (and I do recall hearing that already), then
>there surely must be safe ways to do what I want.
> Milan
- Next message: tomstdenis_at_gmail.com: "Re: Nocona [Intel 64-bit cpu timing]"
- Previous message: Unruh: "Re: Theoretical limits for password length"
- In reply to: Milan VXdgsvt: "Re: Theoretical limits for password length"
- Next in thread: Milan VXdgsvt: "Re: Theoretical limits for password length"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
