[21945] in cryptography@c2.net mail archive
Re: is breaking RSA at least as hard as factoring or vice-versa?
daemon@ATHENA.MIT.EDU (Max)
Sat Apr 8 10:46:35 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Fri, 7 Apr 2006 22:18:20 -0700
From: Max <maxale@gmail.com>
To: "Sean W. Smith" <sws@cs.dartmouth.edu>
Cc: "Greg Rose" <ggr@qualcomm.com>, "Travis H." <solinym@gmail.com>,
Cryptography <cryptography@metzdowd.com>
In-Reply-To: <043513DB-636D-43DD-A5AF-80367BC59CCE@cs.dartmouth.edu>
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 List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
