• DocumentCode
    3298861
  • Title

    High performance elliptic curve point operations with pipelined GF(2m) field multiplier

  • Author

    Al-Somani, Turki F. ; Amin, Alaaeldin

  • Author_Institution
    Umm Al-Qura Univ., Makkah
  • fYear
    2008
  • fDate
    March 31 2008-April 4 2008
  • Firstpage
    82
  • Lastpage
    88
  • Abstract
    This paper studies the effect of high performance pipelined GF(2256) bit-serial multiplier on elliptic curve point operations. A 3-stage pipelined version of the Massy-Omura GF(2m) normal basis multiplier for 160 lesm les 256 was studied in terms of area overhead and throughput improvement. Simple gate area and delay models were used to estimate the throughput of the pipelined and the non-pipelined multipliers. The proposed pipelined architecture has been shown to have a significant improvement in throughput allowing a single 3-stage pipelined multiplier to have higher throughput than an architecture employing three parallel non-pipelined multipliers. The AT2 performance metric has shown an even more significant improvement.
  • Keywords
    Galois fields; cryptography; multiplying circuits; pipeline processing; elliptic curve cryptosystems; high performance elliptic curve point operations; pipelined GF(2m ) field multiplier; pipelined architecture; Computer architecture; Delay estimation; Elliptic curve cryptography; Elliptic curves; Galois fields; High performance computing; Measurement; Parallel processing; Public key cryptography; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Systems and Applications, 2008. AICCSA 2008. IEEE/ACS International Conference on
  • Conference_Location
    Doha
  • Print_ISBN
    978-1-4244-1967-8
  • Electronic_ISBN
    978-1-4244-1968-5
  • Type

    conf

  • DOI
    10.1109/AICCSA.2008.4493520
  • Filename
    4493520