In this section

    High Performance Elliptic Curve GF(2m) Crypto-processor

    (2006) High Performance Elliptic Curve GF(2m) Crypto-processor. Information Technology Journal (ITJ), 5 (4). pp. 742-748. ISSN 1812-5638

    [img] HTML (Abstract)
    e.htm
    Download (8kB)
    [img]
    Preview
    		 PDF (Paper)
    E.pdf
    Download (399kB) | Preview

    Abstract

    This study presents a high performance elliptic curve cryptoprocessor architecture over GF(2m). The proposed architecture exploits parallelism at the projective coordinate level to perform parallel field multiplications. Comparisons between the Projective, Jacobian and Lopez-Dahab coordinate systems using sequential and parallel designs are presented. Results show that parallel designs gives better area-time complexity (AT2) than sequential designs by 44-252% which leads to a wide range of design tradeoffs. The results also show that the Projective coordinate system gives the best AT2 in parallel designs with the least number of multiplications levels when using 4 multipliers.

    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:57
    Last Modified: 01 Nov 2019 13:22
    URI: http://eprints.kfupm.edu.sa/id/eprint/172