Mathematical Attacks on RSA Cryptosystem
Abstract
In this paper some of the most common attacks against Rivest, Shamir, and Adleman (RSA) cryptosystem are presented. We describe the integer factoring attacks, attacks on the underlying mathematical function, as well as attacks that exploit details in implementations of the algorithm. Algorithms for each type of attacks are developed and analyzed by their complexity, memory requirements and area of usage.
DOI: https://doi.org/10.3844/jcssp.2006.665.671
Copyright: © 2006 Imad K. Salah, Abdullah Darwish and Saleh Oqeili. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 4,490 Views
- 17,508 Downloads
- 11 Citations
Download
Keywords
- RSA
- cryptography
- cryptanalysis
- attack
- factorization
- low-exponent
- one-way function