Re: [Newbie] Prime factorization question

From: Marcel Martin (mm_at_ellipsa.no.spam.net)
Date: 10/11/03 

Date: Sat, 11 Oct 2003 00:35:38 +0200

Mxsmanic a écrit :
>
> Marcel Martin writes:
>
> > No, it works (p^e)^d = p^(ed) = p mod pq
> >
> > but you are right that there is a problem:
> >
> > p^(ed-1) = x mod pq with x <> 1 because the equation implies that x
> > must be a multiple of p.
> > You can check that p*p^(ed-1) = px = p^2 a = p mod pq
>
> What are the practical consequences of this in a cryptosystem?

None. I suppose that the RSA designers know since the beginning that
their algorithm works over a ring and not over a field :-)

MM

Quantcast