• DocumentCode
    800433
  • Title

    A new addition formula for elliptic curves over GF(2n)

  • Author

    Al-Daoud, Essame ; Mahmod, Ramlan ; Rushdan, Mohammad ; Kilicman, Adem

  • Author_Institution
    Univ. Putra Malaysia, Malaysia
  • Volume
    51
  • Issue
    8
  • fYear
    2002
  • fDate
    8/1/2002 12:00:00 AM
  • Firstpage
    972
  • Lastpage
    975
  • Abstract
    We propose an addition formula in projective coordinates for elliptic curves over GF(2n). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.
  • Keywords
    computational complexity; public key cryptography; Koblitz curves; addition formula; complexity analysis; elliptic curves; field multiplications; projective coordinates; random curves; scalar multiplication; Arithmetic; Differential equations; Elliptic curve cryptography; Elliptic curves; Galois fields; Licenses; Security;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2002.1024743
  • Filename
    1024743
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=800433