IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v11y2017i2p11-24.html
   My bibliography  Save this article

Bit Forwarding 3-Bits Technique for Efficient Modular Exponentiation

Author

Listed:
  • Satyanarayana Vollala

    (National Institute of Technology, Tiruchirappalli, India)

  • B. Shameedha Begum

    (National Institute of Technology, Tiruchirappalli, India)

  • Amit D. Joshi

    (National Institute of Technology, Tiruchirappalli, India)

  • N. Ramasubramanian

    (National Institute of Technology, Tiruchirappalli, India)

Abstract

It is widely recognized that the public-key cryptosystems are playing tremendously an important role for providing the security services. In majority of the cryptosystems the crucial arithmetic operation is modular exponentiation. It is composed of a series of modular multiplications. Hence, the performance of any cryptosystem is strongly depends on the efficient implementation of these operations. This paper presents the Bit Forwarding 3-bits(BFW3) technique for efficient implementation of modular exponentiation. The modular multiplication involved in BFW3 is evaluated with the help of Montgomery method. These techniques improves the performance by reducing the frequency of modular multiplications. Results shows that the BFW3 technique is able to reduce the frequency of multiplications by 18.20% for 1024-bit exponent. This reduction resulted in increased throughput of 18.11% in comparison with MME42_C2 at the cost of 1.09% extra area. The power consumption reduced by 8.53% thereby saving the energy up to 10.10%.

Suggested Citation

  • Satyanarayana Vollala & B. Shameedha Begum & Amit D. Joshi & N. Ramasubramanian, 2017. "Bit Forwarding 3-Bits Technique for Efficient Modular Exponentiation," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 11(2), pages 11-24, April.
    • Handle: RePEc:igg:jisp00:v:11:y:2017:i:2:p:11-24
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISP.2017040102
    Download Restriction: no
    ---><---

    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:igg:jisp00:v:11:y:2017:i:2:p:11-24. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.