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

Re: RSA != RSA?



> The problem naturally is not visible when exchanging *public* keys, since
> d is found only in the private key.  It becomes an issue only when a key
> *pair* is being generated on one system for use by another, and the
> receiving system is being cautious and checking the key for consistency.
It depends on how the consistency checking goes. If one just chooses
a random message, m, compute c = m^e  mod n, m'=c^d mod n,
and compare m = m' mod n, then the checking will pass.

If one chooses to compute de = 1 mod **, then it may fail.

Steve



References: