1994-09-29 - Re: Anyone seen the ‘quantum cryptanalysis’ thread on sci.crypt?

Header Data

From: Jim Hart <hart@chaos.bsu.edu>
To: tcmay@netcom.com (Timothy C. May)
Message Hash: db908aa9823ce5175dd70acd44120354f4cc50c0dd0cc5ac13b19806069b2330
Message ID: <199409291844.NAA10028@chaos.bsu.edu>
Reply To: <199409281757.KAA13989@netcom8.netcom.com>
UTC Datetime: 1994-09-29 18:44:28 UTC
Raw Date: Thu, 29 Sep 94 11:44:28 PDT

Raw message

From: Jim Hart <hart@chaos.bsu.edu>
Date: Thu, 29 Sep 94 11:44:28 PDT
To: tcmay@netcom.com (Timothy C. May)
Subject: Re: Anyone seen the 'quantum cryptanalysis' thread on sci.crypt?
In-Reply-To: <199409281757.KAA13989@netcom8.netcom.com>
Message-ID: <199409291844.NAA10028@chaos.bsu.edu>
MIME-Version: 1.0
Content-Type: text/plain



An important question that arises out of this -- do there exist one way
trapdoor functions that are not in BQP, the class of problems solved
in polynomial time by a quantum computer.  In other words, we need
a function where the forward direction and trapdoor inverse are in P, 
but the normal inverse is harder than factorization and discrete 
logarithm, which are in BQP.

If so, then public key cryptography can persist into the era of
the quantym computer; such P/non-BQP trapdoor inverses would be 
the next genration of public key.

Jim Hart
hart@chaos.bsu.edu




Thread