Sciweavers

3 search results - page 1 / 1
» Deterministic Polynomial-Time Equivalence of Computing the R...
Sort
View
JOC
2007
125views more  JOC 2007»
13 years 6 months ago
Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring
Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key-pair (e, d) yield the factorization o...
Jean-Sébastien Coron, Alexander May
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
14 years 13 days ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa