Cryptanalysis of RSA with Small Prime Difference using Unravelled Linearization
Santosh Kumar.R, Narasimham.C Narasimham.C, Pallam Setty.S · International Journal of Computer Applications · 2013
In 2002, de Weger showed that choosing an RSA modulus with a small difference of primes improves the attack given by Boneh-Durfee.For this attack, de Weger used the complicated geometrical progressive matrices, introduced by Boneh-Durfee.In this paper, we analyzed by using another technique called unravelled linearization.