In this section

    Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor

    (2007) Area Flexible GF(2k) Elliptic Curve Cryptography Coprocessor. International Arab Journal of Information Technology (IAJIT), 4 (1). pp. 1-10.

    [img]
    Preview
    		 PDF (Paper)
    A.pdf
    Download (321kB) | Preview
    [img] HTML (Abstract)
    a.htm
    Download (7kB)
    Official URL: http://www.iajit.org/

    Abstract

    Elliptic curve cryptography (ECC) is popularly defined either over GF(p) or GF(2k). This research modifies a GF(p) multiplication algorithm to make it applicable for GF(2k). Both algorithms, the GF(p) and GF(2k) one, are designed in hardware to be compared. The GF(2k) multiplier is found faster and small. This GF(2k) multiplier is further improved to benefit in speed, it gained more than 40% faster speed with the cost of 5% more area. This multiplier hardware is furthermore adjusted to have area flexibility feature, which is used as the basic block in modeling a complete projective coordinate GF(2k) ECC coprocessor.

    Item Type: Article
    Subjects: Math
    Computer
    Electrical
    Department: College of Computing and Mathematics > Computer Engineering
    Depositing User: ADNAN ABDU GUTUB (gutub
    Date Deposited: 01 Mar 2008 12:31
    Last Modified: 01 Nov 2019 13:22
    URI: http://eprints.kfupm.edu.sa/id/eprint/169