Re: RSA: more than one secret exponent d exists ???
- From: Kristian Gjøsteen <kristiag+news@xxxxxxxxxxxx>
- Date: Tue, 6 Jun 2006 10:42:06 +0000 (UTC)
<dan.ulma@xxxxxxxxx> wrote:
Kristian Gjøsteen wrote:
First you use Fermat's little
theorem to prove that the order of x modulo p divides p-1.
how do i prove that ?
That's essentially what Fermat's little theorem says. Look it up.
--
Kristian Gjøsteen
.
- References:
- RSA: more than one secret exponent d exists ???
- From: georgezhim
- Re: RSA: more than one secret exponent d exists ???
- From: dan . ulma
- Re: RSA: more than one secret exponent d exists ???
- From: Kristian Gjøsteen
- Re: RSA: more than one secret exponent d exists ???
- From: dan . ulma
- RSA: more than one secret exponent d exists ???
- Prev by Date: Re: RSA: more than one secret exponent d exists ???
- Next by Date: Re: RSA: more than one secret exponent d exists ???
- Previous by thread: Re: RSA: more than one secret exponent d exists ???
- Next by thread: Re: RSA: more than one secret exponent d exists ???
- Index(es):
