GF(2 K) elliptic curve cryptographic processor architecture based n bit level pipelined digit serial multiplication
Summary form only given. New processor architecture for elliptic curve encryption is proposed. The architecture exploits projective coordinates to convert GF(2 k) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2 k) multipliers implemented u...
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/14737/1/14737_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14737/2/14737_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
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 radix parallel architecture for GF(p) elliptic curve processor
by: Gutub, A.A.-A.
Published: (2003) -
Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
by: Gutub, Adnan
Published: (2006) -
High performance elliptic curve GF(2/sup k/) cryptoprocessor architecture for multimedia
by: Gutub, A.A.-A.
Published: (2003) -
Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor
by: Gutub, Adnan
Published: (2007)