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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| id |
my.upm.eprints.30393 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.303932015-09-17T07:18:52Z http://psasir.upm.edu.my/id/eprint/30393/ On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems Al-Saffar, Najlae F. Hameed Md. Said, Mohamad Rushdan 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. Malaysian Society for Cryptology Research 2013 Article NonPeerReviewed application/pdf en 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 Al-Saffar, Najlae F. Hameed and Md. Said, Mohamad Rushdan (2013) On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems. International Journal of Cryptology Research, 4 (1). pp. 42-54. ISSN 1985-5753 http://www.mscr.org.my/ijcr_volumes%204(1).htm |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| language |
English |
| description |
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. |
| format |
Article |
| author |
Al-Saffar, Najlae F. Hameed Md. Said, Mohamad Rushdan |
| spellingShingle |
Al-Saffar, Najlae F. Hameed Md. Said, Mohamad Rushdan On the mathematical complexity and the time implementation of proposed variants of elliptic curves cryptosystems |
| author_facet |
Al-Saffar, Najlae F. Hameed Md. Said, Mohamad Rushdan |
| author_sort |
Al-Saffar, Najlae F. Hameed |
| title |
On the mathematical complexity and the time implementation
of proposed variants of elliptic curves cryptosystems |
| title_short |
On the mathematical complexity and the time implementation
of proposed variants of elliptic curves cryptosystems |
| title_full |
On the mathematical complexity and the time implementation
of proposed variants of elliptic curves cryptosystems |
| title_fullStr |
On the mathematical complexity and the time implementation
of proposed variants of elliptic curves cryptosystems |
| title_full_unstemmed |
On the mathematical complexity and the time implementation
of proposed variants of elliptic curves cryptosystems |
| title_sort |
on the mathematical complexity and the time implementation
of proposed variants of elliptic curves cryptosystems |
| publisher |
Malaysian Society for Cryptology Research |
| publishDate |
2013 |
| url |
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 |
| _version_ |
1643830045496573952 |
| score |
13.250246 |