Partially homomorphic encryption algorithm based on elliptic curves

In this work, partially homomorphic encryption algorithm based on elliptic curves is implemented. The established algorithm allows performing operations of encryption, addition and decryption of various aspects of the system. One of the possible applications of the algorithm is the creation of the depersonalization protocol in the electronic voting systems with different scales. The mathematical model of algorithm and mathematical models of basic analogues, among which it is possible to distinguish the algorithm of Paillier, which is also homomorphic according to the addition operation, are given. Comparison of fast-acting is executed between the algorithm based on elliptic curves and algorithm of Paillier at correlative cryptoproof lengths of the keys.