Yet another paper on the topic:
Deterministic Polynomial Time Equivalence of Computing the RSA Secret
Key and Factoring
by Jean-Sebastien Coron and Alexander May
http://eprint.iacr.org/2004/208
Max
-
The Cryptography Mailing
Dan Boneh had an interesting paper on this topic a few years back
giving some evidence that that breaking RSA might in fact be easier
than factoring.However, it defines breaking RSA as being able
to DO the private-key operation, not as knowing the private key
(because the latter lets
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
At 1:41 -0600 2006/04/02, Travis H. 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
