Re: RSA Cryptography
From: Anton Stiglic (stiglic_at_cs.mcgill.ca)
Date: 08/25/03
- Next message: Colin Andrew Percival: "Re: RSA Cryptography"
- Previous message: AMMS716: "Re: RSA Cryptography"
- In reply to: AMMS716: "Re: RSA Cryptography"
- Next in thread: Colin Andrew Percival: "Re: RSA Cryptography"
- Reply: Colin Andrew Percival: "Re: RSA Cryptography"
- Reply: Bill Unruh: "Re: RSA Cryptography"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Mon, 25 Aug 2003 11:28:00 -0400
"AMMS716" <amms716@aol.com> wrote in message
news:20030825105812.01806.00000422@mb-m22.aol.com...
> It does not matter if you know p and q!!!!
>
> If you know d and N, finding p and q is
> trivial.
>
> Bob
I'm as confused as Gregory is then... we don`t know what e is,
it might be very large, close to the size of N, and d could be 3.
In my point of view, the above statement by Bob is equivalent to
"If you know e and N, where e is the encryption exponent,
finding p and q, the factors of N, is trivial".
which if true, I would really like to know the solution!
--Anton
- Next message: Colin Andrew Percival: "Re: RSA Cryptography"
- Previous message: AMMS716: "Re: RSA Cryptography"
- In reply to: AMMS716: "Re: RSA Cryptography"
- Next in thread: Colin Andrew Percival: "Re: RSA Cryptography"
- Reply: Colin Andrew Percival: "Re: RSA Cryptography"
- Reply: Bill Unruh: "Re: RSA Cryptography"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|