IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0354145.html

Constant-time hardware implementation of Modular Inversion with Kaliski’s Algorithm for ECC

Author

Listed:
  • Khai Nguyen
  • Tung Nguyen
  • Hung Nguyen
  • Linh Tran

Abstract

This paper introduces a hardware architecture designed for constant-time modular inversion over prime fields, a critical function in Elliptic Curve Cryptography (ECC). We use Kaliski’s Almost Inversion Algorithm to develop an efficient FPGA-based solution. The proposed design guarantees constant-time execution, optimizing modular inverse computations for ECC applications. When synthesized on a Xilinx Kintex-7 FPGA, the accelerator reaches a frequency of 222.9 MHz, occupying 1.7k Slices without using any DSP blocks. This work focuses on improving the speed and resource usage of modular inversion units, specifically for resource-constrained digital environments.

Suggested Citation

  • Khai Nguyen & Tung Nguyen & Hung Nguyen & Linh Tran, 2026. "Constant-time hardware implementation of Modular Inversion with Kaliski’s Algorithm for ECC," PLOS ONE, Public Library of Science, vol. 21(7), pages 1-13, July.
    • Handle: RePEc:plo:pone00:0354145
    DOI: 10.1371/journal.pone.0354145
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0354145
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0354145&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0354145?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0354145. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.