Citation
Abstract
The RSA cryptosystem comprises of two important features that are needed for encryption process known as the public parameter e and the modulus N. In 1999, a cryptanalysis on RSA which was described by Boneh and Durfee focused on the key equation and e of the same magnitude to N. Their method was applicable for the case of via Coppersmith’s technique. In 2012, Kumar et al. presented an improved Boneh-Durfee attack using the same equation which is valid for any e with arbitrary size. In this paper, we present an exponential increment of the two former attacks using the variant equation . The new attack breaks the RSA system when a and |c| are suitably small integers. Moreover, the new attack shows that the Boneh-Durfee attack and the attack of Kumar et al. can be derived using a single attack. We also showed that our bound manage to improve the bounds of Ariffin et al. and Bunder and Tonien.
Download File
Full text not available from this repository.
Official URL or Download Paper: https://link.springer.com/article/10.1007/s11042-0...
|
Additional Metadata
Item Type: | Article |
---|---|
Divisions: | Faculty of Science Institute for Mathematical Research |
DOI Number: | https://doi.org/10.1007/s11042-021-11335-8 |
Publisher: | Springer |
Keywords: | RSA; Cryptanalysis'; Coppersmith’s technique; Integer factorization |
Depositing User: | Ms. Nur Aina Ahmad Mustafa |
Date Deposited: | 29 Jul 2024 03:49 |
Last Modified: | 29 Jul 2024 03:49 |
Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1007%2Fs11042-021-11335-8 |
URI: | http://psasir.upm.edu.my/id/eprint/97233 |
Statistic Details: | View Download Statistic |
Actions (login required)
View Item |