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

    Authors

    H. Li; J. Huang; P. Sweany;D. J. Huang

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    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(2(283)) and Tate pairing computation in GF(2(283)). 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. (c) 2008 Elsevier B.V. All rights reserved.

    Journal Title

    Journal of Systems Architecture

    Volume

    54

    Issue/Number

    12

    Publication Date

    1-1-2008

    Document Type

    Article

    First Page

    1077

    Last Page

    1088

    WOS Identifier

    WOS:000261307000001

    ISSN

    1383-7621

    Share

    COinS