Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
In this paper, a fast hardware architecture for elliptic curve cryptography computation in Galois Field GF(p) is proposed. The architecture is implemented for 160-bits, as its data size to handle. The design adopts projective coordinates to eliminate most of the required GF(p) inversion calculations...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/168/1/D.pdf https://eprints.kfupm.edu.sa/id/eprint/168/2/d.htm |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|