Comparative analysis of homomorphic properties of asymmetric cryptosystems RSA and Paillier

Abstract

This study conducts a comparative analysis of homomorphic properties in RSA and Paillier cryptosystems. With growing demands for secure cloud computing and IoT applications, homomorphic encryption enables operations on encrypted data without decryption. The research implements both systems in Python, analyzing their mathematical foundations and performance. Results show RSA multiplicative homomorphism poses security risks, while Paillier additive homomorphism, though computationally heavier, provides secure privacy-preserving operations. Paillier excels in electronic voting and secure data analytics, whereas RSA remains optimal for traditional encryption. The findings guide cryptosystem selection based on specific security and functionality requirements in modern applications.