Fast elliptic curve cryptographic processor architecture based on three parallel GF(2/sup k/) bit level pipelined digit serial multipliers
Unusual processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates (x=X/Z, y=Y/Z) to convert GF(2/sup k/) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2/sup k/) multipl...
Saved in:
| Main Author: | Gutub, A.A.-A. (author) |
|---|---|
| Other Authors: | unknown (author) |
| Format: | article |
| Published: |
2003
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14101/1/14101_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14101/2/14101_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Similar Items
-
GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication
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) -
High radix parallel architecture for GF(p) elliptic curve processor
by: Gutub, A.A.-A.
Published: (2003) -
Bit-level pipelined digit serial GF(2m) multiplier
by: Ibrahim, M.K.
Published: (2001) -
Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations
by: Gutub, Adnan
Published: (2007)