Re: Cryptography and P=NP

Article View: sci.crypt

Article #1766

#1766

From: Vaughan R. Pratt
Date: Mon, 16 Nov 1992 15:25

11 lines
1105 bytes

In article <PHR.92Nov15203840@napa.telebit.com> phr@telebit.com (Paul Rubin) writes:
>It is true that if P=NP then all cryptography everywhere (not just RSA)
>is dead; but at this point I wouldn't take Swart's claims seriously
>without seeing some consensus among complexity efforts that unlike
>his previous attempts, his latest effort is free of bugs.

To rephrase Herman Rubin's point: an O(n^1000) algorithm for an NP-hard
problem will show P=NP without compromising cryptography in the
slightest.
-- 
Vaughan Pratt	  		A fallacy is worth a thousand steps.

Technical Details

Message-ID: <1992Nov16.152501.22172@CSD-NewsHost.Stanford.EDU>

Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!CSD-NewsHost.Stanford.EDU!Sunburn.Stanford.EDU!pratt

References: <1992Nov15.110945.19939@ringer.cs.utsa.edu> <PHR.92Nov15203840@napa.telebit.com>

Show Full Headers

Complete Article Headers

Newsgroups: sci.crypt,sci.math,comp.theory
Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!CSD-NewsHost.Stanford.EDU!Sunburn.Stanford.EDU!pratt
From: pratt@Sunburn.Stanford.EDU (Vaughan R. Pratt)
Subject: Re: Cryptography and P=NP
Message-ID: <1992Nov16.152501.22172@CSD-NewsHost.Stanford.EDU>
Sender: news@CSD-NewsHost.Stanford.EDU
Organization: Computer Science Department,  Stanford University.
References: <1992Nov15.110945.19939@ringer.cs.utsa.edu> <PHR.92Nov15203840@napa.telebit.com>
Date: Mon, 16 Nov 1992 15:25:01 GMT
Lines: 11

Reply to Parent Message