High radix parallel architecture for GF(p) elliptic curve processor

A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Gutub, A.A.-A. (author)
مؤلفون آخرون: Ibrahim, M.K. (author), unknown (author)
التنسيق: article
منشور في: 2003
الموضوعات:
الوصول للمادة أونلاين:https://eprints.kfupm.edu.sa/id/eprint/14516/1/14516_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14516/2/14516_2.doc
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513402858110976
author Gutub, A.A.-A.
author2 Ibrahim, M.K.
unknown
author2_role author
author
author_facet Gutub, A.A.-A.
Ibrahim, M.K.
unknown
author_role author
dc.creator.none.fl_str_mv Gutub, A.A.-A.
Ibrahim, M.K.
unknown
dc.date.none.fl_str_mv 2003-04
2020
dc.format.none.fl_str_mv application/pdf
application/msword
dc.identifier.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/14516/1/14516_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14516/2/14516_2.doc
(2003) High radix parallel architecture for GF(p) elliptic curve processor. Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International conference, 2.
dc.language.none.fl_str_mv en
en
dc.publisher.none.fl_str_mv IEEE
dc.relation.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/14516/
dc.rights.*.fl_str_mv info:eu-repo/semantics/openAccess
dc.subject.none.fl_str_mv Computer
dc.title.none.fl_str_mv High radix parallel architecture for GF(p) elliptic curve processor
dc.type.none.fl_str_mv Article
PeerReviewed
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description A new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better performance than the conventional choice of projecting into the current (X/Z/sup 2/,Y/Z/sup 3/). We also propose to use high radix modulo multipliers which give a wide range of area-time trade-offs. The proposed architecture is a significant challenger for implementing data security systems based on elliptic curve cryptography.
eu_rights_str_mv openAccess
format article
id KFUPM_e5336d8bbdb1862e69c417a6fc664e3f
identifier_str_mv (2003) High radix parallel architecture for GF(p) elliptic curve processor. Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International conference, 2.
language_invalid_str_mv en
network_acronym_str KFUPM
network_name_str King Fahd University of Petroleum and Minerals
oai_identifier_str oai::14516
publishDate 2003
publisher.none.fl_str_mv IEEE
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling High radix parallel architecture for GF(p) elliptic curve processorGutub, A.A.-A.Ibrahim, M.K.unknownComputerA new GF(p) cryptographic processor architecture for elliptic curve encryption/decryption is proposed in this paper. The architecture takes advantage of projective coordinates to convert GF(p) inversion needed in elliptic point operations into several multiplication steps. Unlike existing sequential designs, we show that projecting into (X/Z,Y/Z) leads to a much better performance than the conventional choice of projecting into the current (X/Z/sup 2/,Y/Z/sup 3/). We also propose to use high radix modulo multipliers which give a wide range of area-time trade-offs. The proposed architecture is a significant challenger for implementing data security systems based on elliptic curve cryptography.IEEE2003-042020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14516/1/14516_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14516/2/14516_2.doc (2003) High radix parallel architecture for GF(p) elliptic curve processor. Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03). 2003 IEEE International conference, 2. enenhttps://eprints.kfupm.edu.sa/id/eprint/14516/info:eu-repo/semantics/openAccessoai::145162019-11-01T14:06:09Z
spellingShingle High radix parallel architecture for GF(p) elliptic curve processor
Gutub, A.A.-A.
Computer
status_str publishedVersion
title High radix parallel architecture for GF(p) elliptic curve processor
title_full High radix parallel architecture for GF(p) elliptic curve processor
title_fullStr High radix parallel architecture for GF(p) elliptic curve processor
title_full_unstemmed High radix parallel architecture for GF(p) elliptic curve processor
title_short High radix parallel architecture for GF(p) elliptic curve processor
title_sort High radix parallel architecture for GF(p) elliptic curve processor
topic Computer
url https://eprints.kfupm.edu.sa/id/eprint/14516/1/14516_1.pdf
https://eprints.kfupm.edu.sa/id/eprint/14516/2/14516_2.doc