Secret Sharing Based on Elliptic Curves

چکیده مقاله

In this paper we propose a secret sharing scheme based on elliptic curves over unsecured channel. The security of this method is based on hardness of Discrete Logarithm Problem (DLP) of elliptic curves. In addition we use Edwards curve because it provides a time effiecient for point addition formula.