Right, I've been having a think about this and I think that anyone trying to attack RSA is going about it the wrong way. They're trying to find the factors for a specific reason, such as to break the Xbox Private Key, or for RSA contest etc. Therefore, every time you brute force a key the result is lost as it's "wrong" for the problem you're trying to comlete - the resources might as well never have been dedicated to the project.
A better way of attacking the problem would be to make a huge array of all the known primes, and then multiplying them with one another to creative a huge array of prime number factors. You could do this via a free distributed project, where the client asks for 2 primes, it multiplies them, uploads to the server and allow the results to be avaliable to all.
This information would be of interest of anyone trying to crack the cryptography that relies on prime factors (yay, most) so it'd be a big project and it would be much more useful to the "real world" than Distributed.Net's RC5 project.
There are several problems with this though. People could deliberately crapflood the distributed project with false results undetected, you'd need a silly amount of storage space (and I mean silly, but the cost of storage is also decreasing all the time), and there would be very little interest in companies sponsoring the project or being able to extract any funds from it. To be useful, you'd also need a silly amount of users.
Of course, I could be talking bullshit, but IMO if you're after trying to weaken the RSA algorithm, creating a huge ass list of prime factors would be the best starting point to work from.
Edit: Thinking about the numbers involved, actually, you really are talking silly amounts of storage space and the chance of stumbling on something useful to anybody is still pathetically small. And then you have to factor in the fact that it's prime factors doesn't just mean two primes. Thus this post is all but useless. Of course, the principles could be useful in 50 years, but by then you can go to even bigger primes... but the amount of primes decreases the bigger the numbers... Hm.