High Performance Elliptic Curve GF(2m) Crypto-processor
This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| التنسيق: | article |
| منشور في: |
2006
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/172/1/e.htm https://eprints.kfupm.edu.sa/id/eprint/172/2/E.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513379794681856 |
|---|---|
| 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/172/1/e.htm https://eprints.kfupm.edu.sa/id/eprint/172/2/E.pdf (2006) High Performance Elliptic Curve GF(2m) Crypto-processor. Information Technology Journal (ITJ), 5 (4). pp. 742-748. ISSN 1812-5638 |
| dc.language.none.fl_str_mv | en en |
| dc.publisher.none.fl_str_mv | Asian Network for Scientific Information |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/172/ http://www.ansijournals.com/3/c4p.php?id=1&theme=3&jid=itj |
| 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 | High Performance Elliptic Curve GF(2m) Crypto-processor |
| 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 elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems using sequential and parallel designs are presented. Results show that parallel designs gives better area-time complexity (AT2) than sequential designs by 44-252% which leads to a wide range of design tradeoffs. The results also show that the Projective coordinate system gives the best AT2 in parallel designs with the least number of multiplications levels when using 4 multipliers. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_60252a65eef7040c19909c2675e7de63 |
| identifier_str_mv | (2006) High Performance Elliptic Curve GF(2m) Crypto-processor. Information Technology Journal (ITJ), 5 (4). pp. 742-748. ISSN 1812-5638 |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::172 |
| publishDate | 2006 |
| publisher.none.fl_str_mv | Asian Network for Scientific Information |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | High Performance Elliptic Curve GF(2m) Crypto-processorAl-Somani, Turki FaisalIbrahim, Mohammad K.Gutub, AdnanunknownMathComputerElectricalThis study presents a high performance elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems using sequential and parallel designs are presented. Results show that parallel designs gives better area-time complexity (AT2) than sequential designs by 44-252% which leads to a wide range of design tradeoffs. The results also show that the Projective coordinate system gives the best AT2 in parallel designs with the least number of multiplications levels when using 4 multipliers.Asian Network for Scientific Information20062020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articletext/htmlapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/172/1/e.htmhttps://eprints.kfupm.edu.sa/id/eprint/172/2/E.pdf (2006) High Performance Elliptic Curve GF(2m) Crypto-processor. Information Technology Journal (ITJ), 5 (4). pp. 742-748. ISSN 1812-5638 enenhttps://eprints.kfupm.edu.sa/id/eprint/172/http://www.ansijournals.com/3/c4p.php?id=1&theme=3&jid=itjinfo:eu-repo/semantics/openAccessoai::1722019-11-01T13:22:45Z |
| spellingShingle | High Performance Elliptic Curve GF(2m) Crypto-processor Al-Somani, Turki Faisal Math Computer Electrical |
| status_str | publishedVersion |
| title | High Performance Elliptic Curve GF(2m) Crypto-processor |
| title_full | High Performance Elliptic Curve GF(2m) Crypto-processor |
| title_fullStr | High Performance Elliptic Curve GF(2m) Crypto-processor |
| title_full_unstemmed | High Performance Elliptic Curve GF(2m) Crypto-processor |
| title_short | High Performance Elliptic Curve GF(2m) Crypto-processor |
| title_sort | High Performance Elliptic Curve GF(2m) Crypto-processor |
| topic | Math Computer Electrical |
| url | https://eprints.kfupm.edu.sa/id/eprint/172/1/e.htm https://eprints.kfupm.edu.sa/id/eprint/172/2/E.pdf |