At 03:50 PM 08/06/2003 -0700, Major Variola (ret) wrote:
Yes, but the cryptanalysis of symmetric ciphers involves
exponentially-expanding back trees.
That is the whole point of avalanche. If, somehow, for any NP
algorithm there were an equivalent P algorithm,
then the block-cipher backtracking
At 01:28 PM 8/6/03 -0400, Billy wrote:
At 01:18 AM 8/6/03 -0700, Eric Cordian wrote:
What if all things computable are computable in polynomial time?
You mean polynomials like O(n^10^10^10) ?
subset{P} != easy
There could still be some protection with some crypto schemes, in such
a world,
What if all things computable are computable in polynomial time?
Lots of problems are only computable in exponential time,
or at least superpolynomial time.
The closest we'd get to your suggestion is that
P might equal NP, or (for crypto) factoring might be in P.
Sufficiently large polynomials are
At 03:50 PM 8/6/03 -0700, Major Variola (ret) wrote:
At 02:16 PM 8/6/03 -0700, Bill Stewart wrote:
..
While the public-key algorithms are based on math problems like
factoring or discrete log, most of the symmetric-key algorithms
are based on intractable ugliness, and on doing enough analysis
to
At 01:18 AM 8/6/03 -0700, Eric Cordian wrote:
An anonymous sender writes:
Rely on math, not humans.
What if all things computable are computable in polynomial time?
RSA, Inc. stock would go down.
We would have to go back to paper and OTP, but we would also get to
enjoy the
excellent graphics,
