Revisiting Wiener's Attack --- New Weak Keys in RSA
ISC '08 Proceedings of the 11th international conference on Information Security
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Deterministic polynomial time equivalence between factoring and key-recovery attack on Takagi's RSA
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Finding small roots of bivariate integer polynomial equations: a direct approach
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Small secret key attack on a variant of RSA (due to Takagi)
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Correcting errors in RSA private keys
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Solving generalized small inverse problems
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Security analysis of an RSA key generation algorithm with a large private key
ISC'11 Proceedings of the 14th international conference on Information security
| Hi-index | 0.00 |
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 of N = pq in polynomial time? It is well known that there is a probabilistic polynomial-time algorithm that on input (N,e,d) outputs the factors p and q. We present the first deterministic polynomial-time algorithm that factors N given (e,d) provided that e,d