IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/8883614.html
   My bibliography  Save this article

A Hardware-Efficient Elliptic Curve Cryptographic Architecture over GF (p)

Author

Listed:
  • Chao Cui
  • Yun Zhao
  • Yong Xiao
  • Weibin Lin
  • Di Xu

Abstract

This paper proposes a hardware-efficient elliptic curve cryptography (ECC) architecture over GF(p), which uses adders to achieve scalar multiplication (SM) through hardware-reuse method. In terms of algorithm, the improvement of the interleaved modular multiplication (IMM) algorithm and the binary modular inverse (BMI) algorithm needs two adders. In addition to the adder, the data register is another optimize target. The design compiler is synthesized on 0.13 µ m CMOS ASIC platform. The time range of performing scalar multiplication over 160, 192, 224, and 256 field orders under 150 MHz frequency is 1.99–3.17 ms. Moreover, the gate area required for different field orders in this design is in the range of 35.65k–59.14k, with 50%–91% hardware resource less than other processors.

Suggested Citation

  • Chao Cui & Yun Zhao & Yong Xiao & Weibin Lin & Di Xu, 2021. "A Hardware-Efficient Elliptic Curve Cryptographic Architecture over GF (p)," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-7, May.
    • Handle: RePEc:hin:jnlmpe:8883614
    DOI: 10.1155/2021/8883614
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/8883614.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2021/8883614.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/8883614?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:hin:jnlmpe:8883614. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.