Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
Yao Lu,Rui Zhang,D. Lin
2013 · DOI: 10.1007/978-3-642-39059-3_5
Australasian Conference on Information Security and Privacy · 13 Citations
TLDR
A polynomial-time algorithm to solve the fundamental problem of factors large integers with classical computers, and it is shown that even if a small proportion of bits in the secret primes is leaked, one may efficiently factor.