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...
保存先:
主要な著者: | Al-Saffar, Najlae F. Hameed, Md. Said, Mohamad Rushdan |
---|---|
フォーマット: | 論文 |
言語: | 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 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Improved arithmetic on elliptic curves over prime field
著者:: Al Saffar, Najlae Falah Hameed, 等
出版事項: (2014) -
High performance methods of elliptic curve scalar multiplication
著者:: Al Saffar, Najlae Falah Hameed, 等
出版事項: (2014) -
A lucas based cryptosystem analog to the ElGamal cryptosystem and elliptic curve cryptosystem
著者:: Wong, Tze Jin, 等
出版事項: (2014) -
Speeding up the elliptic curve scalar multiplication using the window- w non adjacent form
著者:: Al Saffar, Najlae Falah Hameed, 等
出版事項: (2015) -
Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
著者:: Al-Saffar, Najlae Falah Hameed
出版事項: (2015)