Factoring $$N=p^rq^s$$ for Large r and s
From MaRDI portal
Publication:2799036
DOI10.1007/978-3-319-29485-8_26zbMath1334.11091OpenAlexW2225440610MaRDI QIDQ2799036
Guénaël Renault, Jean-Charles Faugère, Rina Zeitoun, Jean-Sébastien Coron
Publication date: 8 April 2016
Published in: Topics in Cryptology - CT-RSA 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-29485-8_26
Related Items (5)
Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ Exploiting the security of N = prqs through approximation of ϕ(N) ⋮ A generalized attack on the multi-prime power RSA ⋮ Deterministic factoring with oracles ⋮ Further improvement of factoring \(N=p^rq^s\) with partial known bits
This page was built for publication: Factoring $$N=p^rq^s$$ for Large r and s