FPGA implementation of an elliptic curve cryptosystem over GF(3 m)

Ilker Yavuz*, Siddika Berna Örs Yalçin, Çetin Kaya Koç

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of which is a modular multiplication unit implemented using the systolic Montgomery multiplication algorithm. Another novelty of our proposed architecture is that it implements the field GF(3 m), which provides significant performance gains.

Original languageEnglish
Title of host publicationProceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008
Pages397-402
Number of pages6
DOIs
Publication statusPublished - 2008
Event2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008 - Cancun, Mexico
Duration: 3 Dec 20085 Dec 2008

Publication series

NameProceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008

Conference

Conference2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008
Country/TerritoryMexico
CityCancun
Period3/12/085/12/08

Fingerprint

Dive into the research topics of 'FPGA implementation of an elliptic curve cryptosystem over GF(3 m)'. Together they form a unique fingerprint.

Cite this