TY - JOUR
T1 - FPGA implementations of elliptic curve cryptography and Tate pairing over a binary field
AU - Li, Hao
AU - Huang, Jian
AU - Sweany, Philip
AU - Huang, Dijiang
N1 - Funding Information:
Research is supported by Arizona State University Embedded System Consortium (CES) grant #AQS0005.
PY - 2008/12
Y1 - 2008/12
N2 - 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.
AB - 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.
KW - Elliptic curve cryptography
KW - Field programmable gate array
KW - Galois field arithmetic
KW - Parallel processing
KW - Tate pairing
UR - http://www.scopus.com/inward/record.url?scp=54049099571&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=54049099571&partnerID=8YFLogxK
U2 - 10.1016/j.sysarc.2008.04.012
DO - 10.1016/j.sysarc.2008.04.012
M3 - Article
AN - SCOPUS:54049099571
SN - 1383-7621
VL - 54
SP - 1077
EP - 1088
JO - Journal of Systems Architecture
JF - Journal of Systems Architecture
IS - 12
ER -