Skip to Main content Skip to Navigation
Conference papers

Factoring $N=p^r q^s$ for Large $r$ and $s$

Abstract : Boneh et al. showed at Crypto 99 that moduli of the form N = p^r q can be factored in polynomial time when r ≃ log(p). Their algorithm is based on Coppersmith’s technique for finding small roots of polynomial equations. In this paper we show that N = p^r q^s can also be factored in polynomial time when r or s is at least (log p)^3; therefore we identify a new class of integers that can be efficiently factored. We also generalize our algorithm to moduli with k prime factors N = \prod_{i=1}^k p_i^{r_i} ; we show that a non-trivial factor of N can be extracted in polynomial-time if one of the exponents r_i is large enough.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Guénaël Renault Connect in order to contact the contributor
Submitted on : Friday, November 11, 2016 - 3:01:58 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:04 PM
Long-term archiving on: : Thursday, March 16, 2017 - 11:42:36 AM


Files produced by the author(s)



Jean-Sébastien Coron, Jean-Charles Faugère, Guénaël Renault, Rina Zeitoun. Factoring $N=p^r q^s$ for Large $r$ and $s$. RSA Conference Cryptographers' Track , Feb 2016, San Francisco, United States. ⟨10.1007/978-3-319-29485-8_26⟩. ⟨hal-01250302⟩



Record views


Files downloads