Cryptanalysis on prime power RSA modulus of the form N=prq

Cryptanalysis on prime power RSA modulus of the form N=prq

Let \(N = p^r q\) be an RSA prime power modulus for \(r \geq 2\) and \(q < p < 2 q\). This paper propose three new attacks. In the first attack we consider the class of public exponents satisfying an equation \(e X - N Y = u p^r + \frac{q^r}{u} + Z\) for suitably small positive integer \(u\)....

Full description

Bibliographic Details
Main Authors: Kamel Ariffin, Muhammad Rezal, Shehu, Sadiq
Format: Article
Language:English
Published: 2016
Online Access:http://psasir.upm.edu.my/id/eprint/55401/
http://psasir.upm.edu.my/id/eprint/55401/1/Cryptanalysis%20on%20prime%20power%20RSA%20modulus%20of%20the%20form%20N%3Dprq.pdf

Similar Items

Similar Items