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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2007
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/155/1/I.pdf https://eprints.kfupm.edu.sa/id/eprint/155/2/i.htm |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513379767418880 |
|---|---|
| author | Gutub, Adnan |
| author2 | unknown |
| author2_role | author |
| author_facet | Gutub, Adnan unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Gutub, Adnan unknown |
| dc.date.none.fl_str_mv | 2007-12 2020 |
| dc.format.none.fl_str_mv | application/pdf text/html |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/155/1/I.pdf https://eprints.kfupm.edu.sa/id/eprint/155/2/i.htm (2007) Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations. Kuwait Journal of Science & Engineering (KJSE), December 2007, 34 (2). pp. 165-182. |
| dc.language.none.fl_str_mv | en en |
| dc.publisher.none.fl_str_mv | Kuwait University |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/155/ http://www.kjse.kuniv.edu.kw/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Math Computer Electrical |
| dc.title.none.fl_str_mv | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | 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 coordinates together with scalable Montgomery multipliers for data size of up to 256-bits. We propose using four multiplier cores together with the ordinary projective coordinates which outperform implementations with Jacobean coordinates typically believed to perform better. The proposed architecture is particularly attractive for elliptic curve cryptosystems when hardware area optimization is the key concern. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_c744d9639cdd9567b77671843a676711 |
| identifier_str_mv | (2007) Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations. Kuwait Journal of Science & Engineering (KJSE), December 2007, 34 (2). pp. 165-182. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::155 |
| publishDate | 2007 |
| publisher.none.fl_str_mv | Kuwait University |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operationsGutub, AdnanunknownMathComputerElectricalThis 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 coordinates together with scalable Montgomery multipliers for data size of up to 256-bits. We propose using four multiplier cores together with the ordinary projective coordinates which outperform implementations with Jacobean coordinates typically believed to perform better. The proposed architecture is particularly attractive for elliptic curve cryptosystems when hardware area optimization is the key concern.Kuwait University2007-122020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdftext/htmlhttps://eprints.kfupm.edu.sa/id/eprint/155/1/I.pdfhttps://eprints.kfupm.edu.sa/id/eprint/155/2/i.htm (2007) Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations. Kuwait Journal of Science & Engineering (KJSE), December 2007, 34 (2). pp. 165-182. enenhttps://eprints.kfupm.edu.sa/id/eprint/155/http://www.kjse.kuniv.edu.kw/info:eu-repo/semantics/openAccessoai::1552019-11-01T13:22:38Z |
| spellingShingle | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations Gutub, Adnan Math Computer Electrical |
| status_str | publishedVersion |
| title | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations |
| title_full | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations |
| title_fullStr | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations |
| title_full_unstemmed | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations |
| title_short | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations |
| title_sort | Efficient utilization of scalable multipliers in parallel to compute GF(p) elliptic curve cryptographic operations |
| topic | Math Computer Electrical |
| url | https://eprints.kfupm.edu.sa/id/eprint/155/1/I.pdf https://eprints.kfupm.edu.sa/id/eprint/155/2/i.htm |