Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers
This study presents a high performance GF(2m) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons betw...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , |
| Format: | article |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/173/1/f.htm https://eprints.kfupm.edu.sa/id/eprint/173/2/F.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513399774248960 |
|---|---|
| author | Al-Somani, Turki Faisal |
| author2 | Ibrahim, Mohammad K. Gutub, Adnan unknown |
| author2_role | author author author |
| author_facet | Al-Somani, Turki Faisal Ibrahim, Mohammad K. Gutub, Adnan unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Al-Somani, Turki Faisal Ibrahim, Mohammad K. Gutub, Adnan unknown |
| dc.date.none.fl_str_mv | 2006 2020 |
| dc.format.none.fl_str_mv | text/html application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/173/1/f.htm https://eprints.kfupm.edu.sa/id/eprint/173/2/F.pdf (2006) Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers. Journal of Computer Science (JCS), 2 (5). pp. 395-400. ISSN 1549-3636 |
| dc.language.none.fl_str_mv | en en |
| dc.publisher.none.fl_str_mv | Science Publications |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/173/ http://www.scipub.org/scipub/detail_issue.php?V_No=10&j_id=jcs |
| 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 | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | This study presents a high performance GF(2m) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons between the Projective, Jacobian and Mixed coordinate systems using sequential and parallel designs are presented. Results show that parallel designs using normal basis gives better areatime complexity (AT2) than sequential designs by 33-252% which leads to a wide range of design tradeoffs. The results also show that mixed coordinate system is the best in both sequential and parallel designs and gives the least number of multiplications levels when using 3 multipliers and the best AT2 when using only 2 multipliers. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_b899c7ecef58fb74ec70aef8ba302ffe |
| identifier_str_mv | (2006) Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers. Journal of Computer Science (JCS), 2 (5). pp. 395-400. ISSN 1549-3636 |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::173 |
| publishDate | 2006 |
| publisher.none.fl_str_mv | Science Publications |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field MultipliersAl-Somani, Turki FaisalIbrahim, Mohammad K.Gutub, AdnanunknownMathComputerElectricalThis study presents a high performance GF(2m) Elliptic Curve Crypto-processor architecture. The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. In the proposed architecture, normal basis representation is used. Comparisons between the Projective, Jacobian and Mixed coordinate systems using sequential and parallel designs are presented. Results show that parallel designs using normal basis gives better areatime complexity (AT2) than sequential designs by 33-252% which leads to a wide range of design tradeoffs. The results also show that mixed coordinate system is the best in both sequential and parallel designs and gives the least number of multiplications levels when using 3 multipliers and the best AT2 when using only 2 multipliers.Science Publications20062020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articletext/htmlapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/173/1/f.htmhttps://eprints.kfupm.edu.sa/id/eprint/173/2/F.pdf (2006) Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers. Journal of Computer Science (JCS), 2 (5). pp. 395-400. ISSN 1549-3636 enenhttps://eprints.kfupm.edu.sa/id/eprint/173/http://www.scipub.org/scipub/detail_issue.php?V_No=10&j_id=jcsinfo:eu-repo/semantics/openAccessoai::1732019-11-01T13:22:46Z |
| spellingShingle | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers Al-Somani, Turki Faisal Math Computer Electrical |
| status_str | publishedVersion |
| title | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers |
| title_full | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers |
| title_fullStr | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers |
| title_full_unstemmed | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers |
| title_short | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers |
| title_sort | Highly Efficient Elliptic Curve Crypto-Processor with Parallel GF(2m) Field Multipliers |
| topic | Math Computer Electrical |
| url | https://eprints.kfupm.edu.sa/id/eprint/173/1/f.htm https://eprints.kfupm.edu.sa/id/eprint/173/2/F.pdf |