On 4/2/06, Travis H. <[EMAIL PROTECTED]> wrote:
> So I'm reading up on unconditionally secure authentication in Simmon's
> "Contemporary Cryptology", and he points out that with RSA, given d,
> you could calculate e (remember, this is authentication not
> encryption) if you could factor n, which relates the two.

This implication runs both ways. Given d and e (and pq), one can
compute p and q. Proving this is an exercise left to the reader.

"You can't prove anything."
    -- Gödel's Incompetence Theorem

The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to [EMAIL PROTECTED]

Reply via email to