[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

RE: RSA != RSA?

To: IP Security List <ipsec@lists.tislabs.com>
Subject: RE: RSA != RSA?
From: Alexey Kirichenko <Alexey.Kirichenko@F-Secure.com>
Date: Fri, 09 Feb 2001 12:36:15 +0200
In-Reply-To: <F86F34FDF1F9D411B7A40008C74C27B813792E@hhdata3.cdsemea.baltimore.com>
Sender: owner-ipsec@lists.tislabs.com

At 08:59 9.2.2001 -0000, you wrote:
>Any idea how many? (just for academic interest)
>
>Chris

This depends. Generally, if you find one such a value, say, d0,
then any other has a form
d = d0 + k * LCM(p-1, q-1), k is integer,
and you're interested only in values that belong to [1, p*q - 1]
interval. For example, if LCM(p-1, q-1) = (p-1) * (q-1) / 2,
then there are just two (for absolute majority of encryption keys)
or three (in rare cases) distinct values of the decryption key.
If (p-1) and (q-1) have some more common factors, then the number
of distinct decryption keys will be greater, it's approximately equal
to GCD(p-1, q-1).

Alexey

References:

RE: RSA != RSA?

From: Chris Trobridge <CTrobridge@baltimore.com>

Prev by Date: Re: RSA != RSA?
Next by Date: Re: RSA != RSA?
Prev by thread: RE: RSA != RSA?
Next by thread: Re: RSA != RSA?
Index(es):
- Main
- Thread