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: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Malaysian Society for Cryptology Research
2013
|
| Online Access: | 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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|