GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication
Summary form only given. New processor architecture for elliptic curve encryption is proposed. The architecture exploits projective coordinates to convert GF(2 k) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2 k) multipliers implemented u...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Published: |
2003
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14737/1/14737_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14737/2/14737_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Summary form only given. New processor architecture for elliptic curve encryption is proposed. The architecture exploits projective coordinates to convert GF(2 k) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2 k) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than using fully parallel multipliers with the added advantage of requiring less area. The proposed architecture is a serious contender for implementing data security systems based on elliptic curve cryptography. |
|---|