Elliptic curve cryptography (ECC) is mainly an ...

Elliptic curve cryptography (ECC) is mainly an

alternative to traditional public-key cryptosystems (PKCs),

such as RSA, due to its smaller key size with same security

level for resource-constrained networks. The computational

efficiency of ECC depends on the scalar point multiplication,

which consists of modular point addition and point doubling

operations. The paper emphasizes on point multiplication

techniques such as Binary, NAF, w-NAF and different

coordinate systems like Affine and Projective (Standard

Projective, Jacobian and Mixed) for point addition and doubling

operations. These operations are compared based on execution

time. The results given here are for general purpose processor

with 1:73 GH z frequency. The implementation is done over

NIST-recommended prime fields 192/224/256/384/521.

### Statistics

### Views

- Total Views
- 103
- Views on SlideShare
- 102
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 0
- Comments
- 0

### Accessibility

### Categories

### Upload Details

Uploaded via SlideShare as Adobe PDF

### Usage Rights

© All Rights Reserved

Full NameComment goes here.