[21725] in cryptography@c2.net mail archive
Re: is breaking RSA at least as hard as factoring or vice-versa?
daemon@ATHENA.MIT.EDU (Sean W. Smith)
Mon Apr 3 11:44:26 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
In-Reply-To: <p0623094bc0560111e39f@[10.0.1.28]>
Cc: "Travis H." <solinym@gmail.com>,
Cryptography <cryptography@metzdowd.com>
From: "Sean W. Smith" <sws@cs.dartmouth.edu>
Date: Mon, 3 Apr 2006 06:36:30 -0400
To: Greg Rose <ggr@qualcomm.com>
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 you factor).
Boneh and Venkatesan. "Breaking RSA may not be equivalent to
factoring." Eurocrypt '98. Springer-Verlag LNCS 1233. 1998.
--Sean
Sean W. Smith, Ph.D. sws@cs.dartmouth.edu www.cs.dartmouth.edu/~sws/
Department of Computer Science, Dartmouth College, Hanover NH USA
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
