12 search results - page 1 / 3 » Computing the RSA Secret Key Is Deterministic Polynomial Tim... |
115
Voted
JOC
2007
15 years 9 days ago
2007
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...
CRYPTO
2004
Springer
15 years 5 months ago
2004
Springer
121
click to vote
PKC
2007
Springer
15 years 6 months ago
2007
Springer
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...
94
Voted
CRYPTO
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Let pk = (N , e) be an RSA public key with corresponding secret key sk = (p, q, d, dp, dq , q-1 p ). Assume that we obtain partial error-free information of sk, e.g., ass...
CRYPTO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In 1998, Boneh, Durfee and Frankel [4] presented several attacks on RSA when an adversary knows a fraction of the secret key bits. The motivation for these so-called part...