Re: simple public key question.

From: Douglas A. Gwyn (DAGwyn_at_null.net)
Date: 06/22/03 

Date: Sun, 22 Jun 2003 08:12:16 -0400

Bill C wrote:
> s... But if (n,e) is the public key and we
> can compute d from e (and given n) then how could the private key (n,
> d) be secret.

d is computed from the combination (e,p,q). Since
the public doesn't know p nor q it can't use that
algorithm to compute d. So far as we know,
figuring out d from e alone is too computationally
difficult to pose a significant risk (for numbers
of the sizes used in public-key cryptography).

Relevant Pages

  • Re: simple public key question.
    ... > Bill C wrote: ... >> d) be secret. ... > of the sizes used in public-key cryptography). ... either a book or website? ...
    (sci.crypt)
  • Re: Is there any authentication algorithm with
    ... jos sulistyo wrote: ... >I am looking for an authentication algorithm, preferably a public-key ... authenticate using 32 bits, but the attacker ...
    (sci.crypt)
  • Re: hiding a counter
    ... secret. ... proven that no public-key encryption system can be made that cannot be ... The question is whether anyone can muster the amount of brute force ... anyone can muster that amount of force and cleverness. ...
    (comp.unix.programmer)
  • Re: simple public key question.
    ... ]> Bill C wrote: ... ]> of the sizes used in public-key cryptography). ... oOne way of calculating d is to divide phi by e, ... find a number, r, such that r times the remainer plus 1 is a multiple of e. ...
    (sci.crypt)