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...

全面介绍

Saved in:
书目详细资料
Main Authors: Al-Saffar, Najlae F. Hameed, Md. Said, Mohamad Rushdan
格式: Article
语言: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.