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 metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01250302
Contributor : Guénaël Renault <>
Submitted on : Friday, November 11, 2016 - 3:01:58 PM
Last modification on : Thursday, March 21, 2019 - 1:05:01 PM
Long-term archiving on : Thursday, March 16, 2017 - 11:42:36 AM

File

Copp16.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

593

Files downloads

182