Authors | Mojtaba Bahramian, Maryam Sheikhi, Fatemeh Seyfi |
---|---|
Conference Title | همایش The First Conference on Computational Group Theory, Computational Number Theory and Applications |
Holding Date of Conference | 2014-12-17 |
Event Place | Kashan |
Presentation | SPEECH |
Conference Level | Internal Conferences |
Abstract
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