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: | , |
|---|---|
| 格式: | Article |
| 语言: | English |
| 出版: |
Malaysian Society for Cryptology Research
2013
|
| 在线阅读: | http://psasir.upm.edu.my/30393/ http://psasir.upm.edu.my/30393/ http://psasir.upm.edu.my/30393/1/On%20the%20mathematical%20complexity%20and%20the%20time%20implementation%20of%20proposed%20variants%20of%20elliptic%20curves%20cryptosystems.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|