Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture

This paper merges between elliptic curve addition presents a modified processor architecture for Elliptic Curve Cryptography computations in Galois Fields GF(p). The architecture incorporates the methodology of pipelining to utilize the benefit of both parallel and serial implementations. It allows...

وصف كامل

محفوظ في:
التفاصيل البيبلوغرافية
المؤلف الرئيسي: Gutub, Adnan (author)
مؤلفون آخرون: unknown (author)
التنسيق: article
منشور في: 2006
الموضوعات:
الوصول للمادة أونلاين:https://eprints.kfupm.edu.sa/id/eprint/174/1/h.htm
https://eprints.kfupm.edu.sa/id/eprint/174/2/H.pdf
http://paper.ijcsns.org/07_book/200603/200603A06.pdf
الوسوم: إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
_version_ 1864513399776346112
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 2006-03
2020
dc.format.none.fl_str_mv text/html
application/pdf
dc.identifier.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/174/1/h.htm
https://eprints.kfupm.edu.sa/id/eprint/174/2/H.pdf
(2006) Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture. International Journal of Computer Science and Network Security (IJCSNS), 6 (3A). pp. 44-52. ISSN 1738-7906
http://paper.ijcsns.org/07_book/200603/200603A06.pdf
dc.language.none.fl_str_mv en
en
dc.publisher.none.fl_str_mv IJCSNS, Dae-Sang Office 301, Sangdo 5 dong 509-1, Dongjack Gu, Seoul 156-743, Korea
dc.relation.none.fl_str_mv https://eprints.kfupm.edu.sa/id/eprint/174/
http://ijcsns.org/
http://paper.ijcsns.org/07_book/200603/200603A06.pdf
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 Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
dc.type.none.fl_str_mv Article
PeerReviewed
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/article
description This paper merges between elliptic curve addition presents a modified processor architecture for Elliptic Curve Cryptography computations in Galois Fields GF(p). The architecture incorporates the methodology of pipelining to utilize the benefit of both parallel and serial implementations. It allows the exploitation of the inherited independency that exists in elliptic curve point addition and doubling operations using a single pipelined core. The processor architecture showed attraction because of its improvement over many parallel and serial implementations of elliptic curve crypto-systems. It proved to be efficient having better performance with regard to area, speed, and power consumption.
eu_rights_str_mv openAccess
format article
id KFUPM_dbfd4956f0bdc075268ca3cc5fb0df9b
identifier_str_mv (2006) Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture. International Journal of Computer Science and Network Security (IJCSNS), 6 (3A). pp. 44-52. ISSN 1738-7906
language_invalid_str_mv en
network_acronym_str KFUPM
network_name_str King Fahd University of Petroleum and Minerals
oai_identifier_str oai::174
publishDate 2006
publisher.none.fl_str_mv IJCSNS, Dae-Sang Office 301, Sangdo 5 dong 509-1, Dongjack Gu, Seoul 156-743, Korea
repository.mail.fl_str_mv
repository.name.fl_str_mv
repository_id_str
spelling Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC ArchitectureGutub, AdnanunknownMathComputerElectricalThis paper merges between elliptic curve addition presents a modified processor architecture for Elliptic Curve Cryptography computations in Galois Fields GF(p). The architecture incorporates the methodology of pipelining to utilize the benefit of both parallel and serial implementations. It allows the exploitation of the inherited independency that exists in elliptic curve point addition and doubling operations using a single pipelined core. The processor architecture showed attraction because of its improvement over many parallel and serial implementations of elliptic curve crypto-systems. It proved to be efficient having better performance with regard to area, speed, and power consumption.IJCSNS, Dae-Sang Office 301, Sangdo 5 dong 509-1, Dongjack Gu, Seoul 156-743, Korea2006-032020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articletext/htmlapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/174/1/h.htmhttps://eprints.kfupm.edu.sa/id/eprint/174/2/H.pdf (2006) Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture. International Journal of Computer Science and Network Security (IJCSNS), 6 (3A). pp. 44-52. ISSN 1738-7906 http://paper.ijcsns.org/07_book/200603/200603A06.pdfenenhttps://eprints.kfupm.edu.sa/id/eprint/174/http://ijcsns.org/http://paper.ijcsns.org/07_book/200603/200603A06.pdfinfo:eu-repo/semantics/openAccessoai::1742019-11-01T13:22:46Z
spellingShingle Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
Gutub, Adnan
Math
Computer
Electrical
status_str publishedVersion
title Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
title_full Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
title_fullStr Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
title_full_unstemmed Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
title_short Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
title_sort Merging GF(p) Elliptic Curve Point Adding and Doubling on Pipelined VLSI Cryptographic ASIC Architecture
topic Math
Computer
Electrical
url https://eprints.kfupm.edu.sa/id/eprint/174/1/h.htm
https://eprints.kfupm.edu.sa/id/eprint/174/2/H.pdf
http://paper.ijcsns.org/07_book/200603/200603A06.pdf