[Cryptography] A new method to (partly) factorize RSA 250 and other large copmposite numbers

[Sandy Harris]

Antje Wissmann <a.h.w at gmx.ch> wrote:

> RSA 250 is a number with 250 decimal digits. Using the method I’m talking about it’s possible to check the first group of
>
> 20831160293131638348898886842852463138276835849237265490215514 factors (of the form 6n – 1)
>
> with the result that non of them divides RSA 250. That proce­dure will take only a few minutes ...

> If one takes a much bigger number with 2500 decimal digits for example, ... the method will check approximately 10^623 (!) possible factors at one time

Are you saying you have a general method to check approximately
N^(1/4) factors in parallel? Even if it applies only to factors of the
form 6n-1, that is interesting.