Successful cryptanalytic attacks upon RSA moduli N = pq

This paper reports four new cryptanalytic attacks which show that t instances of RSA moduli Ns = psqs for s = 1, . . . , t where t ≥ 2 can be simultaneously factored in polynomial time using simultaneous Diophantine approximations and lattice basis reduction techniques. We construct four system of e...

Full description

Saved in:
Bibliographic Details
Main Authors: Abubakar, Saidu Isah, Kamel Ariffin, Muhammad Rezal, Asbullah, Muhammad Asyraf
Format: Article
Language:English
Published: Institute for Mathematical Research, Universiti Putra Malaysia 2019
Online Access:http://psasir.upm.edu.my/id/eprint/76378/1/10.pdf
http://psasir.upm.edu.my/id/eprint/76378/
http://einspem.upm.edu.my/journal/fullpaper/vol13saugust/10.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Putra Malaysia
Language: English

Similar Items