Secret Sharing Based on Elliptic Curves

نویسندگانمجتبی بهرامیان,مریم شیخی گرجان,فاطمه سیفی شهپر
همایشThe First Conference on Computational Group Theory, Computational Number Theory and Applications
تاریخ برگزاری همایش۲۰۱۴-۱۲-۱۷
محل برگزاری همایشکاشان
نوع ارائهسخنرانی
سطح همایشملی

چکیده مقاله

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.