3 search results - page 1 / 1 » Deterministic Polynomial-Time Equivalence of Computing the R... |
JOC
2007
13 years 10 months 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
14 years 4 months ago
2004
Springer
PKC
2007
Springer
14 years 5 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...