Russell Nelson [EMAIL PROTECTED] 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
Russell Nelson [EMAIL PROTECTED] writes:
If
quantum computers make brute-force cryptanalysis tasks easier, don't
they also make brute-force cryptographic tasks easier as well? Put
another way, is there something special about quantum computers that
is different from Intel's next process
Russell Nelson wrote:
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
On the Los Alamos Preprint site (xxx.lanl.gov) today:
quant-ph/9910072 [abs, src, ps, other] :
Title: Quantum secure identification using entanglement and catalysis
Authors: Howard N. Barnum
Comments: 7 pages; no figures
I consider the use of entanglement between two parties to enable one to
Science v. 284, 18 Jun 99 p1967-69
_Quantum computing with electrons floating on liquid helium._
Jist: thousands of qubits possible, wave function changes in
nsec, coheres for msec.
Machinery: very cold helium layer on top of patterned electrodes.
Electrons are stored on other (exposed)
Anonymous [EMAIL PROTECTED] writes:
Quantum computers help cryptanalysis in a couple of specific ways.
They aren't all-purpose speeder-upers.
No. The reason I posted this abstract is because it says exactly the
opposite. *almost* any given Turing machine T can be turned into a
quantum machine
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
At 11:51 AM -0500 10/18/99, Mike Rosing wrote:
On Thu, 14 Oct 1999, Peter Wayner wrote:
Stefan Brands, the man who's written some great digital cash
protocols, has just published a new book called "Building In Privacy:
Rethinking public key
Julian Assange [EMAIL PROTECTED] writes:
Anonymous [EMAIL PROTECTED] writes:
Quantum computers help cryptanalysis in a couple of specific ways.
They aren't all-purpose speeder-upers.
No. The reason I posted this abstract is because it says exactly the
opposite. *almost* any given Turing
