Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations
This paper presents the design and implementation of an elliptic curve cryptographic core to realize point scalar multiplication operations used for the GF(p) elliptic curve encryption/decryption and the elliptic curve digital signature algorithm (ECDSA). The design makes use of projective coordinat...
Saved in:
| Main Author: | Gutub, Adnan (author) |
|---|---|
| Other Authors: | unknown (author) |
| Format: | article |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/155/1/I.pdf https://eprints.kfupm.edu.sa/id/eprint/155/2/i.htm |
| 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) -
Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
by: Gutub, Adnan
Published: (2006) -
Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers
by: Al-Somani, Turki Faisal
Published: (2006) -
Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor
by: Gutub, Adnan
Published: (2007) -
High Speed Hardware Architecture to Compute GF(p) Montgomery Inversion with Scalability Features
by: Gutub, Adnan
Published: (2007)