Open AccessAnalysis of Homomorphic Cryptosystems of Benaloh and Paillier for the Construction of an Electronic Voting System
Author(s) -
V. Salman
Publication year - 2021
Publication title -
trudy učebnyh zavedenij svâzi
Language(s) - English
Resource type - Journals
eISSN - 2712-8830
pISSN - 1813-324X
DOI - 10.31854/1813-324x-2021-7-2-102-109
Subject(s) - paillier cryptosystem , homomorphic encryption , electronic voting , cryptosystem , computer science , voting , scheme (mathematics) , cryptography , theoretical computer science , algorithm , computer security , mathematics , encryption , hybrid cryptosystem , law , mathematical analysis , politics , political science
The analysis of the performance of two cryptographic algorithms (Paillier and Benaloh), in order to apply them in the construction of electronic voting systems is carried out. A description of each system and their homomorphic properties is given. Electronic voting systems based on these schemes are described. The requirements for the voting system are formulated and a comparative analysis of the voting systems based on the schemes of Paillier and Benaloh is carried out. The analysis showed that the Paillier scheme is the best and simplest method for building secure electronic voting systems, while the Benaloh scheme is more complex and computationally more time-consuming.