CFP last date
20 December 2024
Reseach Article

Performance of Parallel RSA on IMAN1 Supercomputer

by Areej Al-Shorman, Mohammad Qatawneh
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 180 - Number 37
Year of Publication: 2018
Authors: Areej Al-Shorman, Mohammad Qatawneh
10.5120/ijca2018916733

Areej Al-Shorman, Mohammad Qatawneh . Performance of Parallel RSA on IMAN1 Supercomputer. International Journal of Computer Applications. 180, 37 ( Apr 2018), 31-36. DOI=10.5120/ijca2018916733

@article{ 10.5120/ijca2018916733,
author = { Areej Al-Shorman, Mohammad Qatawneh },
title = { Performance of Parallel RSA on IMAN1 Supercomputer },
journal = { International Journal of Computer Applications },
issue_date = { Apr 2018 },
volume = { 180 },
number = { 37 },
month = { Apr },
year = { 2018 },
issn = { 0975-8887 },
pages = { 31-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume180/number37/29333-2018916733/ },
doi = { 10.5120/ijca2018916733 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T01:02:57.801070+05:30
%A Areej Al-Shorman
%A Mohammad Qatawneh
%T Performance of Parallel RSA on IMAN1 Supercomputer
%J International Journal of Computer Applications
%@ 0975-8887
%V 180
%N 37
%P 31-36
%D 2018
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Numerous decryption and encryption algorithmic methods have been proposed and applied in prior research, including RSA, DES, etc. Such methods are normally assessed in their performance in accordance with the growth rates of their algorithms, based on key and input sizes. With RSA public-key security algorithms, primary operations feature modular exponentiations and reductions. As a result, sequential implementations of RSA become more computing-time, and energy-intensive. Several parallelization methods are therefore recommended in order to improve the speed of RSA algorithms. In this paper, parallel RSA algorithmic methods are assessed and then compared, based on decryption and encryption running times, speedup, and efficiency. The experimental results show that the runtime of parallel RSA algorithmic method outperform those of sequential RSA algorithmic methods.

References
  1. Menezes, A. J., Van Oorschot, P. C., & Vanstone, S. A. (1996). Handbook of applied cryptography. CRC press.
  2. Saxena, S., & Kapoor, B. (2014, February). An efficient parallel algorithm for secured data communications using RSA public key cryptography method. In Advance Computing Conference (IACC), 2014 IEEE International (pp. 850-854). IEEE.
  3. Lakkadwala, M., & Valiveti, S. (2017, January). Parallel generation of RSA keys—A review. In Cloud Computing, Data Science & Engineering-Confluence, 2017 7th International Conference on (pp. 350-355). IEEE.
  4. Lin, Y. S., Lin, C. Y., & Lou, D. C. (2012, May). Efficient parallel RSA decryption algorithm for many-core GPUs with CUDA. In International Conference on Telecommunication Systems, Modeling and Analysis (ICTSM2012).
  5. Fadhil, H. M., & Younis, M. I. (2014). Parallelizing RSA algorithm on multicore CPU and GPU. International Journal of Computer Applications, 87(6).
  6. Chang, C. C., & Hwang, M. S. (1996). Parallel computation of the generating keys for RSA cryptosystems. Electronics Letters, 32(15), 1365-1366.
  7. Rao, B. S., & Ramesh, M. An Efficient Parallel Algorithm for Secure Data Communication Using RSA Algorithm. red, 100111(11101000), 11001001.
  8. Asaduzzaman, A., Gummadi, D., & Waichal, P. (2015, April). A promising parallel algorithm to manage the RSA decryption complexity. In SoutheastCon 2015 (pp. 1-5). IEEE.
  9. Tan, X., & Li, Y. (2012, March). Parallel analysis of an improved RSA algorithm. In Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on (Vol. 1, pp. 318-320). IEEE.
  10. Saadeh, M., Saadeh, H., & Qatawneh, M. (2016). Performance Evaluation of Parallel Sorting Algorithms on IMAN1 Supercomputer. International Journal of Advanced Science and Technology, 95, pp. 57-72.
  11. Bruce, S. (1995). Applied cryptography: protocols, algorithms, and source code in C, Second Edition. John Wiley & Sons.
  12. Ananth, G., Anshul, G., George, K,. & Vipin, K. (2003). Introduction to Parallel Computing, Second Edition, Addison Wesley.
  13. Kasahara, H., & Narita, S. (1984). Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Transactions on Computers, 33(11), pp. 1023-1029.
  14. Qatawneh Mohammad. (2005). Embedding Linear Array network into the Tree-Hypercube Network. European Journal of Scientific research, 10(2), pp. 72-77.
  15. Mohammad Qatawneh, Ahmad Alamoush, Ja’far Alqatawneh. (2015). Section Based Hex-Cell Routing Algorithm (SBHCR). International Journal of Computer Networks & Communications (IJCNC), 7(1), pp. 167-177.
  16. Azzam Sleit, Wesam AlMobaideen, Mohammad Qatawneh, Heba Saadeh. (2008). Efficient processing for binary submatrix matching. American Journal of Applied Sciences, 6(1), pp. 78-88.
  17. Mohammad Qatawneh (2011). Embedding Binary Tree and Bus into Hex-Cell Interconnection Network. Journal of American Science. 7(12), pp.367-370.
  18. Qatawneh Mohammad, Hebatallah Khattab 2015. New Routing Algorithm for Hex-Cell Network. International Journal of Future Generation Communication and Networking. 8(2), pp. 295-306.
  19. Mohammad Qatawneh 2016. New Efficient Algorithm for Mapping Linear Array into Hex-Cell Network. International Journal of Advanced Science and Technology. 90, pp. 9-14.
Index Terms

Computer Science
Information Sciences

Keywords

Cryptography RSA MPI Supercomputer Public Key Private Key Parallel algorithm