High Performance Elliptic Curve GF(2m) Crypto-processor
This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/172/1/e.htm https://eprints.kfupm.edu.sa/id/eprint/172/2/E.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems using sequential and parallel designs are presented. Results show that parallel designs gives better area-time complexity (AT2) than sequential designs by 44-252% which leads to a wide range of design tradeoffs. The results also show that the Projective coordinate system gives the best AT2 in parallel designs with the least number of multiplications levels when using 4 multipliers. |
|---|