Re:An Argument for P=NP (2005) [pdf]
by jessaustin on Monday August 17, 2015 @07:55PM
(#10076851)
Is there a reason to believe that no e.g. PSPACE algorithm would be suitable for signatures? (Even assuming that such are not practical now, can we say they wouldn't eventually be practical in a P=NP world?)
Depends on what kind of tools you're talking about. For instance, if P==NP then there can be no such thing as a secure digital signature algorithm; anybody who can efficiently verify a signature can also forge one. (Making the usual simplification that "efficient" == "polynomial-time", that is.)