Impossible compression still not possible. [was RE: Debunking the PGP backdoor myth for good. [was RE: Hypothesis: PGP backdoor (was: A security bug in PGP products?)]]

[John Denker]

Dave Korn asked:

>   Is it *necessarily* the case that /any/
> polynomial of log N /necessarily/ grows slower than N?

Yes.

Hint:  L'Hôpital's rule.

> if P(x)==e^(2x)

That's not a polynomial.

x^Q is a polynomial.  Q^x is not.

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at metzdowd.com