* David Wagner:
> (Do note that factoring is not NP-complete.)
It's also possible to factor an n-bit number in O(n^k) integer
additions, substractions, multiplications, divisions and comparisons
to zero, for some smallish fixed value of k (an observations which is
due to Schönhage, IIRC). So you
Jerry Leichter wrote:
>> If current physical theories are even approximately correct,
>> there are limits to how many "bit flips" (which would
>> encompass all possible binary operations) can occur in
>> a fixed volume of space-time.
> The physical arguments to which I was referring say *nothing*
Alexander Klimov wrote:
> A problem with this reasoning is that the physical world and the usual
> digital computers have exponential simulation gap (it is known at
> least in one direction: to simulate N entangled particles on a digital
> computer one needs computations exponential in N). This ca
On Aug 10, 2009, at 4:42 AM, Alexander Klimov wrote:
On Sun, 9 Aug 2009, Jerry Leichter wrote:
Since people do keep bringing up Moore's Law in an attempt to justify
larger keys our systems "stronger than cryptography," it's worth
keeping in mind that we are approaching fairly deep physical limi
