Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers
This study presents a high performance GF(2m) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons betw...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/173/1/f.htm https://eprints.kfupm.edu.sa/id/eprint/173/2/F.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|