FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field

Hao Li, Jian Huang, Philip Sweany, Dijiang Huang

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Abstract

Elliptic curve cryptography (ECC) and Tate pairing are two new types of public-key cryptographic schemes that become popular in recent years. ECC offers a smaller key size compared to traditional methods without sacrificing security level. Tate pairing is a bilinear map commonly used in identity-based cryptographic schemes. Therefore, it is more attractive to implement these schemes by using hardware than by using software because of its computational expensiveness. In this paper, we propose field programmable gate array (FPGA) implementations of the elliptic curve point multiplication in Galois field GF (2283) and Tate pairing computation in GF (2283). Experimental results demonstrate that, compared with previously proposed approaches, our FPGA implementations of ECC and Tate pairing can speed up by 31.6 times and 152 times, respectively.

Original languageEnglish (US)
Pages (from-to)1077-1088
Number of pages12
JournalJournal of Systems Architecture
Volume54
Issue number12
DOIs
StatePublished - Dec 2008

Keywords

  • Elliptic curve cryptography
  • Field programmable gate array
  • Galois field arithmetic
  • Parallel processing
  • Tate pairing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field'. Together they form a unique fingerprint.

Cite this