[4788] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: quantum codebreaker

daemon@ATHENA.MIT.EDU (Mike Stay)
Mon May 24 14:24:03 1999

Date: Mon, 24 May 1999 10:34:40 -0600
From: Mike Stay <staym@accessdata.com>
To: coderpunks@toad.com
Cc: cryptography@c2.net

This is a multi-part message in MIME format.

--------------128238123813
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit

-- 
Mike Stay
Cryptographer / Programmer
AccessData Corp.
mailto:staym@accessdata.com

--------------128238123813
Content-Type: message/rfc822
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

>From slloyd@MIT.EDU  Mon May 24 10:23:14 1999
Received: from MIT.EDU (PACIFIC-CARRIER-ANNEX.MIT.EDU [18.69.0.28]) by accessdata.com (8.8.5) id KAA10889; Mon, 24 May 1999 10:23:13 -0600 (MDT)
From: slloyd@MIT.EDU
X-Authentication-Warning: accessdata.com: Host PACIFIC-CARRIER-ANNEX.MIT.EDU [18.69.0.28] claimed to be MIT.EDU
Received: from ELOISE.MIT.EDU by MIT.EDU with SMTP
	id AA14836; Mon, 24 May 99 12:23:16 EDT
Received: by ELOISE.mit.edu (SMI-8.6/4.7) id MAA12754; Mon, 24 May 1999 12:23:00 -0400
Message-Id: <199905241623.MAA12754@ELOISE.mit.edu>
To: staym@accessdata.com
Date: Mon, 24 May 1999 12:23:00 EDT
Sender: slloyd@MIT.EDU

Dear Mike,
	I think you've overestimated the implications of this method for 
code breaking.  My previous work with Dan Abrams did indeed show
that nonlinear quantum mechanics could be used to solve
NP and #P oracle problems (which in my opinion should be
regarded as evidence against nonlinear quantum mechanics).
The idea is to use the nonlinearity to amplify small differences
in the wave function.  The feedback method described in the current
paper could also be used to amplify small differences: accordingly,
you could use it to solve hard problems by the same method.
The catch is that order to amplify differences of the size
1/N, you need N copies of the same system.  So to solve
exponentially hard problems by this feedback method, you
need exponentially many copies (we're up front about this
in the paper).  Cryptography remains as safe as it was before.  
Which is a lucky thing, since I'm about to use the web to buy 
some plane tickets.

Yours,
	Seth 


--------------128238123813--



home help back first fref pref prev next nref lref last post