Improving the Efficiency of Partial Homomorphic Encryption RSA and Developing it into a Hybrid System

Nibras Hadi

doi:10.5269/bspm.81209

Nibras Hadi University of Al-Qadisiyah

Résumé

Previous research has carried out several investigations into the mechanics of encryption and the approaches that might speed up computations. It became necessary to develop these algorithms and leverage other technologies to achieve greater efficiency and performance in encryption systems by improving RSA encryption technology. RSA is a type of partial homogeneous encryption mechanism that enables and accelerates multiplication on encrypted data that contains large numbers and requires significant computational effort. Therefore, the system was improved to be more efficient by using the Extended Residual System (RNSBE), with a time reduction of up to 75% compared to the previous system. A hybrid RSA-Pa system was also introduced, combining the characteristics of the RSA algorithm and the Paillier algorithm, resulting in a strong and robust hybrid.

Téléchargements

Les données sur le téléchargement ne sont pas encore disponible.

Références

[1] S. Nisha, & M. Farik, “RSA public key cryptography algorithm”, A Review. International Journal of Scientific and Technological Research, 6, 187-191.‏2017.
[2] L. F. Katran, E. N. AlShemmary, & W. A. M. Al-Jawher, “Integrating Swin Transformer with Fuzzy Gray Wolve Optimization for MRI Brain Tumor Classification”, International Journal of Intelligent Engineering & Systems, 17(6).‏ 2024.
[3] L. F. Katran, E. N. AlShemmary, & W. A. Al-Jawher, “Enhanced MRI classification through the integration of a Swin-S Transformer and Db4 wavelet transform”, In AIP Conference Proceedings (Vol. 3264, No. 1, p. 040024). AIP Publishing LLC.‏ 2025.
[4] J. Ye, L. Wang, Z. Wang, Z. Zhang, Z. Xu, & J. Zhao, “An Electronic Voting Scheme with Privacy Protection”, Procedia Computer Science, 243, 1248-1256.‏ 2024.
[5] D. Chandravathi, & P. V. Lakshmi, “Privacy preserving using extended Euclidean algorithm applied to RSA-homomorphic encryption technique”, International Journal of Innovative Technology and Exploring Engineering, 8(10), 3175-3179. 2019.
[6] N. H. Jawad, “FHE Cryptographic Systems with Using Chaotic Secret Key Generation”, Boletim da Sociedade Paranaense de Matemática. vol. 43, ISSN-0037-8712, 2025.
[7] F. J. Taylor, “Residue arithmetic a tutorial with examples”, Computer, 17(05), 50-62.‏ 1984.
[8] N. H. Jawad, & S. Abdulhadi, “Efficient Brakerski-Fan-Vercauteren Algorithm Using Hybrid-Position-Residues Number System”, International Journal of Mathematics & Computer Science, 20(2).‏ 2025.
[9] N. H. Jawad, & S. Abdulhadi, “Multiple approaches to Convert RNS to Decimal Numbers”, Journal of Al-Qadisiyah for computer science and mathematics, 15(3), Page-108.‏ 2023.
[10] S. J. Mohammed, & D. B. Taha, “Performance evaluation of RSA, ElGamal, and paillier partial homomorphic encryption algorithms”, In 2022 International Conference on Computer Science and Software Engineering (CSASE) (pp. 89-94). IEEE.‏ 2022.
[11] A.E Mesioye, F.T Ibharalu, S.A Onashoga, O. M. Olayiwola, “Hensel Lifting: A tool for fast decryption process in RSA cryptosystem”, Mathematical Association of Nigeria, 127 – 134, 2019.
[12] K. El Makkaoui, A. Beni-Hssane, & A. Ezzati, “Speedy Cloud-RSA homomorphic scheme for preserving data confidentiality in cloud computing”, Journal of Ambient Intelligence and Humanized Computing, 10(12), 4629-4640.‏ 2019.
[13] H. Touil, N. El Akkad, & K. Satori, “Homomorphic method additive using pailler and multiplicative based on RSA in integers numbers”, In International Conference on Big Data and Internet of Things (pp. 153-164). Cham: Springer International Publishing.‏ 2021.
[14] R. Abid, C. Iwendi, A. R. Javed, M. Rizwan, Z. Jalil, J. H. Anajemba, & C. Biamba, “RETRACTED ARTICLE: An optimised homomorphic CRT-RSA algorithm for secure and efficient communication”, Personal and Ubiquitous Computing, 27(3), 1405-1418.‏ 2023.
[15] P. Krishnadoss, P. T. Krishnan, N. Paramasivam, D. S. Kesavan, & A. T. Raagav, “Dynamic Approach for Time Reduction in RSA Algorithm through Adaptive Data Encryption and Decryption”, International Journal of Intelligent Engineering & Systems, 17(4).‏ 2024.
[16] C. Gilbert, & M. A. Gilbert, “Homomorphic Encryption Algorithms for Secure Data Computation”,‏ International Research Journal of Advanced Engineering and Science, Volume 10,2025.
[17] N. H. Jawad, & S. Abdulhadi, “Efficient Brakerski-Fan-Vercauteren Algorithm Using Hybrid-Position-Residues Number System”, International Journal of Mathematics & Computer Science, 20(2). 2025. ‏
[18] D. Chandravathi, P.V. Lakshmi, “Enhanced homomorphic encryption technique using RSA ALGORITHM with multiple keys”, International Journal of Advanced Trends in Computer Science and Engineering, 2019.
[19] K. Bigou and A. Tisserand, “RNS modular multiplication through reduced base extensions”, 25th IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP). IEEE, 2014.
[20] P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes", In International conference on the theory and applications of cryptographic techniques, (pp. 223-238). Berlin, Heidelberg: Springer Berlin Heidelberg.‏ 1999.