New finding on factoring prime power RSA modulus N = p^rq

DOI10.3770/J.ISSN:2095-2651.2017.04.003zbMATH Open1399.11023MaRDI QIDQ4640577FDOQ4640577

Authors: Sadiq Shehu, Muhammad Rezal Kamel Ariffin 

Publication date: 25 May 2018

Recommendations

• New Attacks on RSA with Moduli N = p r q
• A generalized attack on the multi-prime power RSA
• Revisiting prime power RSA
• Improved results on cryptanalysis of prime power RSA
• A new attack on RSA with two or three decryption exponents

zbMATH Keywords

continued fractionfactorizationsimultaneous Diophantine approximationsRSA prime power

Mathematics Subject Classification ID

Continued fractions (11A55) Diophantine approximation in probabilistic number theory (11K60) Factorization; primality (11A51)

Cited In (4)

• Improved results on cryptanalysis of prime power RSA
• Exploiting the security of \(N= p^r q^s\) through approximation of \(\varphi(N)\)
• New approach for efficiently computing factors of the RSA modulus
• A generalized attack on the multi-prime power RSA

This page was built for publication: New finding on factoring prime power RSA modulus \(N = {p^r}q\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640577)