is breaking RSA at least as hard as factoring or vice-versa?

Max maxale at gmail.com
Sat Apr 8 01:18:20 EDT 2006


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 at metzdowd.com



More information about the cryptography mailing list