• DocumentCode
    2443659
  • Title

    Efficient computation of multiple points for elliptic curve cryptosystems

  • Author

    Wu, Huapeng ; Hasan, M. Anwarul ; Blake, Ian F.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    49
  • Abstract
    A general sliding window method for computing m1P1 +...+mkPk for nonsupersingular curves is presented. Its performance analysis and various speed-up schemes are discussed
  • Keywords
    cryptography; algorithm; elliptic curve cryptosystems; general sliding window method; multiple points computation; nonsupersingular curves; performance analysis; speed-up schemes; Elliptic curve cryptography; Elliptic curves; Laboratories; Milling machines; Performance analysis; Postal services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708629
  • Filename
    708629
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2443659