--- begin forwarded text
Date: Sat, 16 Oct 1999 01:59:03 -0700
To: [EMAIL PROTECTED], [EMAIL PROTECTED]
From: Bill Stewart [EMAIL PROTECTED]
Old-Subject: CDR: Re: how does disappearing.com's crypto work?
Cc: [EMAIL PROTECTED], [EMAIL PROTECTED]
Subject: Re: how does disappearing.com's crypto
Quantum Physics, abstract
quant-ph/9910033
From: "Lane A. Hemaspaandra" [EMAIL PROTECTED]
Date (v1): Fri, 8 Oct 1999 03:48:56 GMT (17kb)
Date (revised v2): Mon, 11 Oct 1999 19:03:38 GMT (17kb)
Almost-Everywhere Superiority for Quantum Computing
Authors: Edith Hemaspaandra (RIT), Lane A.
Julian Assange writes:
Simon as extended by Brassard and H{\o}yer shows that there are
tasks on which quantum machines are exponentially faster than
each classical machine infinitely often. The present paper shows
that there are tasks on which quantum machines are
On Sun, 17 Oct 1999, Russell Nelson wrote:
Okay, then can I ask a silly question (I prefer to contribute good
answers, but in this case hopefully the question is good enough)? If
quantum computers make brute-force cryptanalysis tasks easier, don't
they also make brute-force cryptographic
