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: | Al-Somani, Turki Faisal (author) |
|---|---|
| Other Authors: | Ibrahim, Mohammad K. (author), Gutub, Adnan (author), unknown (author) |
| 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!
|
Similar Items
-
Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers
by: Al-Somani, Turki Faisal
Published: (2006) -
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
by: Gutub, Adnan
Published: (2006) -
Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor
by: Gutub, Adnan
Published: (2007) -
High radix parallel architecture for GF(p) elliptic curve processor
by: Gutub, A.A.-A.
Published: (2003) -
Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations
by: Gutub, Adnan
Published: (2007)