Partially homomorphic encryption algorithm based on elliptic curves

Andrzej Smolarz, Roman N. Kvyetnyy, Yevhenii Tytarchuk, Volodymyr Kotsiubynskyi, Nursanat Askarova

2018

Closed access Metadata (CSL-JSON)
DOI 10.1117/12.2501583
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

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.