🚀 go-pugleaf

> R, S & A consider three approaches to breaking RSA:

> 2) Somehow find d without factoring n.
> 	Once you know d, you can calculate e*d-1 which is a multiple of
> 	T(n).  It has been shown that n can be factored using any
> 	multiple of T(n).
> 
> 	Thus, if you can find d, you can factor n.  Therefore, either
> 	d is impractical to compute, or R, S & A have stumbled on an
> 	easy way to factor large primes.

This shows that you could factor a number IF you find d AND are given e.
Remember that e is computed from d and the prime factors of n.  This
does not translate into a general scheme for factoring.

Bob Stewart
ihnp4!ihlpf!stewart

[Ignore this.  Just wasting space
 and net capacity so that postnews
 will let me post this article.
]