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

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

doi:10.1109/ReConFig.2008.66

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

Department of Electronics and Communication Engineering

Istanbul Technical University
Scientific and Technological Research Council of Turkey
University of California at Santa Barbara
Istanbul Sehir University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008
Pages	397-402
Number of pages	6
DOIs	https://doi.org/10.1109/ReConFig.2008.66
Publication status	Published - 2008
Event	2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008 - Cancun, Mexico Duration: 3 Dec 2008 → 5 Dec 2008

Publication series

Name	Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008

Conference

Conference	2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008
Country/Territory	Mexico
City	Cancun
Period	3/12/08 → 5/12/08

Access to Document

10.1109/ReConFig.2008.66

Cite this

Yavuz, I., Yalçin, S. B. Ö., & Koç, Ç. K. (2008). FPGA implementation of an elliptic curve cryptosystem over GF(3 ^m). In Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008 (pp. 397-402). Article 4731827 (Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008). https://doi.org/10.1109/ReConFig.2008.66

@inproceedings{324a7736330d4f0baa2fc72674ec859f,

title = "FPGA implementation of an elliptic curve cryptosystem over GF(3 m)",

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.",

author = "Ilker Yavuz and Yal{\c c}in, \{Siddika Berna {\"O}rs\} and Ko{\c c}, \{{\c C}etin Kaya\}",

year = "2008",

doi = "10.1109/ReConFig.2008.66",

language = "English",

isbn = "9780769534749",

series = "Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008",

pages = "397--402",

booktitle = "Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008",

note = "2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008 ; Conference date: 03-12-2008 Through 05-12-2008",

}

Yavuz, I, Yalçin, SBÖ & Koç, ÇK 2008, FPGA implementation of an elliptic curve cryptosystem over GF(3 ^m). in Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008., 4731827, Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008, pp. 397-402, 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008, Cancun, Mexico, 3/12/08. https://doi.org/10.1109/ReConFig.2008.66

FPGA implementation of an elliptic curve cryptosystem over GF(3 ^m). / Yavuz, Ilker; Yalçin, Siddika Berna Örs; Koç, Çetin Kaya.
Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008. 2008. p. 397-402 4731827 (Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Yavuz, Ilker

AU - Yalçin, Siddika Berna Örs

AU - Koç, Çetin Kaya

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/62349110330

U2 - 10.1109/ReConFig.2008.66

DO - 10.1109/ReConFig.2008.66

M3 - Conference contribution

AN - SCOPUS:62349110330

SN - 9780769534749

T3 - Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008

SP - 397

EP - 402

BT - Proceedings - 2008 International Conference on Reconfigurable Computing and FPGAs, ReConFig 2008

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

Y2 - 3 December 2008 through 5 December 2008

ER -