Optimizing E-Voting Systems: Integration of Paillier Cryptosystem and Parallel Processing for Enhanced Security and Efficiency

In the modern era, e-voting systems are pivotal in enhancing democratic processes. This research explores the application of the Paillier algorithm's Partial Homomorphic Encryption (PHE) in e-voting, prioritizing data security and voter anonymity to maintain the voting process's integrity and confidentiality. Using the Paillier cryptosystem in Python provides a secure, efficient, and scalable e-voting solution. Our model is compared with conventional and other homomorphic encryption methods, showcasing its superior security and efficiency, offering a viable option for improving elections. The importance of stringent security in e-voting systems is paramount. The Paillier Cryptosystem excels in safeguarding vote confidentiality and integrity thanks to its PHE capabilities. Yet, a significant challenge is the computational demand, especially in large-scale scenario elections where quickly processing millions of votes is critical.