On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems
The group of the elliptic curve points forms an abelian group, which is considered as a suitable choice for constructing a problem similar to the Discrete Logarithm Problem. This creates and opens a new door for treatments of the special group and new operations. In 2005, Al-Saffar (2005) proposed...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Malaysian Society for Cryptology Research
2013
|
| الوصول للمادة أونلاين: | http://psasir.upm.edu.my/id/eprint/30393/1/On%20the%20mathematical%20complexity%20and%20the%20time%20implementation%20of%20proposed%20variants%20of%20elliptic%20curves%20cryptosystems.pdf http://psasir.upm.edu.my/id/eprint/30393/ http://www.mscr.org.my/ijcr_volumes%204(1).htm |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | The group of the elliptic curve points forms an abelian group, which is considered as a suitable choice for constructing a problem similar to the Discrete Logarithm
Problem. This creates and opens a new door for treatments of the special group and new operations. In 2005, Al-Saffar (2005) proposed two new methods for elliptic curve cryptosystems using the keys from the algorithm of Diffie–Hellman Key Exchange. In addition, she introduced a variant of the ElGamal scheme. Also, three propositions were introduced to develop the Menezes-Vanstone Elliptic Curves
Cryptosystem (MVECC). In this paper, we will discuss all of these propositions and will compare them with the original schemes (ElGamal and MVECC) according to the complexity and the time which they took to implement each scheme. |
|---|