Re: Surrogate factoring explained

From: Christian Bau (christian.bau_at_cbau.freeserve.co.uk)
Date: 02/27/05 

Date: Sun, 27 Feb 2005 01:07:45 +0000

In article <386j0mF5gmovlU1@individual.net>,
 Décio Luiz Gazzoni Filho <decio@decpp.removethis.net> wrote:

> ođin wrote:
>
> >>> > Remember, the point of surrogate factoring is to break the RSA
> >>> > encryption technique, which depends on picking special primes so that
> >>> > their product is very hard to factor, by instead shifting to some
> >>> > easier to factor number, and relating its factorization to the
> >>> > factorization of your target.
> >>>
> >>> RSA doesn't depend on special primes.
> >>
> >> What is "special" about them is that they are "large".
> >
> > And James' surrogate is larger than the original composite target. What a
> > fool.
>
> Will you please drop this flawed argument? I've already shown that one can
> pick easily factorable surrogates in a very efficient manner.

Just in case someone hasn't figured it out: ((M-j)*(M+j))^6 may be a
very large number, but I can factor it easily by factoring M-j and M+j
and writing down their factors six times. In the situation given here, M
is well known and j can be chosen freely which won't hurt at all.

Relevant Pages
Quantcast