IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v334y2018icp41-59.html
   My bibliography  Save this article

Fast elliptic curve point multiplication based on window Non-Adjacent Form method

Author

Listed:
  • Khleborodov, Denis

Abstract

This article presents window Non-Adjacent Form (wNAF) of scalar representation method for developing algorithms of computing scalar multiplication in groups of points on an elliptic curve over finite fields. A new efficient wNAF-based algorithm has been presented. The algorithm was developed based on simple and composite operations with a point and also based on affine and Jacobi coordinates systems taking into account the latest achievements in computing cost reduction. The theorem concerning its computational complexity is formulated and proved for this new algorithm. In the end of this article, an efficiency analysis of the proposed algorithm depending on various parameters is presented, namely, the characteristic of the field over which the curve is defined, the scalar length and the window width of the precomputations and the coordinates of the precomputed points. A comparative analysis of the new algorithm and previously known efficient algorithm is also presented.

Suggested Citation

  • Khleborodov, Denis, 2018. "Fast elliptic curve point multiplication based on window Non-Adjacent Form method," Applied Mathematics and Computation, Elsevier, vol. 334(C), pages 41-59.
    • Handle: RePEc:eee:apmaco:v:334:y:2018:i:c:p:41-59
    DOI: 10.1016/j.amc.2018.03.112
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318302935
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.03.112?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:334:y:2018:i:c:p:41-59. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.