On Fri, Apr 24, 2009 at 6:40 PM, Zsbán Ambrus <[email protected]> wrote:
> The point is, an average home computer can easily test the primality
> of any one really huge number in a few moments (and does too when
> doing public-key cryptography),
...
> The same is true for factorization,

I'm being a bit imprecise here though, because while a usual home
computer does do primality tests for public-key cryptography, I do now
think it performs prime factorizatoin often.

Ambrus
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm

Reply via email to