security of rsa private exponent bits

Douglas Hoover (doug@arcot.com)
Mon, 27 Jul 1998 10:51:44 -0700

• Next message: Nilsphone@aol.com: "Question on large integer software"
• Previous message: David Honig: "Re: RNG in a Smart Card"

Does anyone know any results of the following form?

Let N, d, e be RSA modulus, private exponent and public exponent.

- Given N and e, it is hard to deduce certain bits of d.
- Given N and e, and some bits of d, it is hard to deduce any more bits
of d.
- Given N, some bits of e, and some bits of e, it is hard to deduce more
bits of either
  d or e.

Thanks,

Doug Hoover
doug@arcot.com

• Next message: Nilsphone@aol.com: "Question on large integer software"
• Previous message: David Honig: "Re: RNG in a Smart Card"