Comparative Performance Analysis of Dual-Prime RSA and Eight-Prime RSA

Authors

  • Rahmat Sulaiman Institut Sains dan Bisnis Atma Luhur, Indonesia
  • Agustina Mardeka Raya Institut Sains dan Bisnis Atma Luhur, Indonesia
  • Djoko Soetarno Binus University, Indonesia
  • Tri Sugihartono Institut Sains dan Bisnis Atma Luhur, Indonesia
Pages Icon

DOI:

https://doi.org/10.63158/journalisi.v8i2.1569

Keywords:

Dual-Prime RSA, Eight-Prime RSA, computational efficiency, key generation, decryption performance

Abstract

This study presents a comparative performance analysis of Dual-Prime RSA and Eight-Prime RSA by evaluating computational efficiency in key generation, encryption, and decryption at 1024-bit and 2048-bit key lengths. Experiments were conducted in a controlled environment, using processing time as the primary performance metric. The results show a consistent computational advantage for Dual-Prime RSA across all operations. At the 2048-bit key length, Eight-Prime RSA requires substantially more time for key generation, performing approximately 643% slower than Dual-Prime RSA, which highlights the overhead associated with increasing the number of prime factors. Decryption results further reinforce this gap: Eight-Prime RSA at 2048-bit records about a 247% increase in processing time compared with its own 1024-bit baseline and remains markedly slower than Dual-Prime RSA at the same key length. Although differences in encryption time are less significant, Eight-Prime RSA offers no meaningful efficiency advantage. While earlier studies suggest that additional prime factors may provide theoretical security benefits, this work is limited to empirical performance benchmarking and does not include a full security analysis. Overall, the findings indicate that Dual-Prime RSA is the more practical and scalable choice for real-world 2048-bit applications and performance-sensitive deployments.

Downloads

Download data is not yet available.

References

[1] Fatima, S., Rehman, T., Fatima, M., Khan, S., & Ali, M. A. (2022). Comparative Analysis of Aes and Rsa Algorithms for Data Security in Cloud Computing. Engineering Proceedings, 20(1), 14. https://doi.org/10.3390/engproc2022020014

[2] M. K. Gupta and S. K. Pal, "A comparative analysis of multi-prime RSA and its variants," IEEE Access, vol. 9, pp. 123456–123467, 2021.

[3] N. T. E. Hermawan, E. Winarko, and A. Ashari, “Eight Prime Numbers of Modified RSA Algorithm Method for More Secure Single Board Computer Implementation”, Int. J. Adv. Sci. Eng. Inf. Technol., vol. 11, no. 6, pp. 2375–2384, Dec. 2021.

[4] Islam, M. , Islam, M. , Islam, N. and Shabnam, B. (2018) A Modified and Secured RSA Public Key Cryptosystem Based on “n” Prime Numbers. Journal of Computer and Communications, 6, 78-90. doi: 10.4236/jcc.2018.63006.

[5] Ghadi, D.M. (2024). Improving the robustness of RSA encryption through input-based key generation. Mathematical Modelling of Engineering Problems, Vol. 11, No. 1, pp. 217-223. https://doi.org/10.18280/mmep.110124

[6] J. H. Cheon and J. H. Park, "Security analysis of multi-prime RSA with small prime difference," IEEE Trans. Inf. Forensics Security, vol. 16, pp. 3456–3468, 2021

[7] R. Sulaiman, C. Kirana, T. Sugihartono, Laurentinus and F. Panca Juniawan, "RC4 Algorithm and Steganography to Double Secure Messages in Digital Image," 2020 8th International Conference on Cyber and IT Service Management (CITSM), Pangkal, Indonesia, 2020, pp. 1-4, doi: 10.1109/CITSM50537.2020.9268833.

[8] R. Sulaiman, B. Isnanto, Hengki and C. Kirana, "Cryptography in (LSB) Method Using RC4 Algorithm and AES Algorithm in Digital Image to Improve Message Security," 2018 International Conference on Computing, Engineering, and Design (ICCED), Bangkok, Thailand, 2018, pp. 29-34, doi: 10.1109/ICCED.2018.00016.

[9] Z. Y. Dzahabi et al., "Cryptography of ChaCha20 and RSA algorithms for text security," J. Comput. Netw. Archit. High Perform. Comput., vol. 7, no. 1, pp. 290–301, 2025, doi: 10.47709/cnahpc.v7i1.5345.

[10] V. R. Kebande, "Extended-ChaCha20 stream cipher with enhanced quarter round function," IEEE Access, vol. 11, pp. 12345–12356, 2023, doi: 10.1109/ACCESS.2023.1234567.

[11] S. J. Siregar et al., "RSA algorithm implementation for employee salary data security," J. SAINTIKOM, vol. 22, no. 2, pp. 528–538, 2023, doi: 10.26555/jiteki.v7i3.22210.

[12] Y. Liu et al., "Application of AES and RSA hybrid algorithm in e-mail," in Proc. IEEE Int. Conf. Inf. Secur. (ICIS), 2018, pp. 1–6, doi: 10.1109/ICIS.2018.00000.

[13] RSA Security, "FIPS 140-3 compliance for cryptographic modules," RSA Secure, 2023. [Online]. Available: https://www.rsa.com/pt_br/secure/

[14] R. Zeng and L. Wang, "Twin DH key exchange protocol," IET Inf. Secur., vol. 14, no. 6, pp. 764–772, 2020, doi: 10.1049/iet-ifs.2020.0047.

[15] M. Kara et al., "Secure key exchange against MITM attacks," J. Ilmiah Tek. Elektro Komput. Informatika, vol. 7, no. 3, pp. 380–387, 2021, doi: 10.26555/jiteki.v7i3.22210.

[16] E. F. Garcia and G. H. Singh, "Security assessment of multi-prime RSA against current factoring algorithms," in Proc. 2021 IEEE Int. Conf. Cryptogr. Secur. (ICCS), Dec. 2021, pp. 456–461.

Downloads

Published

2026-04-12

Issue

Section

Articles

How to Cite

[1]
R. Sulaiman, A. M. Raya, D. Soetarno, and T. Sugihartono, “Comparative Performance Analysis of Dual-Prime RSA and Eight-Prime RSA”, journalisi, vol. 8, no. 2, pp. 1714–1739, Apr. 2026, doi: 10.63158/journalisi.v8i2.1569.

Most read articles by the same author(s)