🚀 go-pugleaf

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

This isn't true.

You don't have to have an algorithm whose inversion is in NP to have it
be unbreakable.  All you need is a lower bound on the power of the
security parameter.

Ie., if the space-time required to break some algorithm is guaranteed
of order at least k^5, then you know how big to choose k so that a computer
using all the atoms of the universe would take billions of years to
do the inversion.

Of course, I'm told that that's a problem perhaps as hard as P=?NP.

-- 
-- <<Disclaimer: All opinions expressed are my own, of course.>>
-- Carl Ellison						cme@sw.stratus.com
-- Stratus Computer Inc.	M3-2-BKW		TEL: (508)460-2783
-- 55 Fairbanks Boulevard ; Marlborough MA 01752-1298	FAX: (508)624-7488