{0, 1, 3}-NAF representation and algorithms for lightweight elliptic curve cryptosystem in Lopez Dahab model
Elliptic curve scalar multiplications is the most time-consuming and costly operation in elliptic curve cryptosystem. The scalar multiplication involves computation of Q = kP where k is a scalar multiplier, and P and Q are points on an elliptic curve. This computation can be improved by reducing the...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Praise Worthy Prize
2014
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/36116/1/0.pdf http://psasir.upm.edu.my/id/eprint/36116/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|