Re: "smart" bruteforce method for RSA ?

From: Andrew Swallow (am.swallow@eatspam.btinternet.com)
Date: 04/22/03 

From: "Andrew Swallow" <am.swallow@eatspam.btinternet.com>
Date: Tue, 22 Apr 2003 09:17:44 +0000 (UTC)

"real" <pub04@voila.fr> wrote in message
news:eabdb0b4.0304212338.5b6cfb29@posting.google.com...
> Hello
> Please forgive me if I say stupid things, I'm new to this domain.. And
> english is NOT my mother language. Thanks.
>
> Apparently the main problem with private/public key is that we cannot
> factor two large prime numbers because it takes a lot of time to
> compute/bruteforce. At least for RSA coding. I know few methods exist
> to find large prime numbers. So we can make a huge list of prime
> numbers. Let's say, 100 million prime numbers. So why is the
> public/private crypto system so strong, since a bruteforcing with
> those calculated "prime number" keys can be done ?

There are about
340,000,000,000,000,000,000,000,000,000,000,000,000
prime numbers in most RSA systems. Your list of
100,000,000
primes is too small.

Andrew Swallow