At 08:18 AM 3/26/98 -0800, you wrote:
>I would like to get more data on this one.  Every so often someone claims to
>have cracked RSA but in every case I've heard of the claim was false.
>
>The problem is to show mathematically how to factor a *very* large pseudo
>prime number into its two prime factors.  This is the part I want to see.
>
>A billion computers working in parallel to do it once is not a crack.  If in
>fact it was accomplished it was either because the primes were
>insufficiently large or the guy was very lucky.
>
>Rich

RSA is a private key system, right? Therefore, it does not rely on large
prime numbers, does it? I think maybe you are getting confused with public
key systems (such as PGP). Well, a BILLION computers working at once is not
quite a legit. crack, but if it can be done by say 1000 pentiums in a
month, then a few AS400s or a couple of Crays could probably do it in a few
days, then I'd be scared.

Sean



+--------------------------------+
| Sean Breheny                   |
| Amateur Radio Callsign: KA3YXM |
| Electrical Engineering Student |
+--------------------------------+
Fight injustice, please look at
http://homepages.enterprise.net/toolan/joanandrews/

Personal page: http://www.people.cornell.edu/pages/shb7
mailto:shb7@cornell.edu
Phone(USA): (607) 253-0315