High radix parallel architecture for GF(p) elliptic curve processor
A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential...
Saved in:
| Main Author: | Gutub, A.A.-A. (author) |
|---|---|
| Other Authors: | Ibrahim, M.K. (author), unknown (author) |
| Format: | article |
| Published: |
2003
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14516/1/14516_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14516/2/14516_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fast 160-Bits GF (P) Elliptic Curve Crypto Hardware of High-Radix Scalable Multipliers
by: Gutub, Adnan
Published: (2006) -
Fast elliptic curve cryptographic processor architecture based on three parallel GF(2/sup k/) bit level pipelined digit serial multipliers
by: Gutub, A.A.-A.
Published: (2003) -
High performance elliptic curve GF(2/sup k/) cryptoprocessor architecture for multimedia
by: Gutub, A.A.-A.
Published: (2003) -
GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication
by: Gutub, A.A.-A.
Published: (2003) -
Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers
by: Al-Somani, Turki Faisal
Published: (2006)