IDEAS home Printed from https://ideas.repec.org/a/taf/tcybxx/v5y2019i4p209-230.html
   My bibliography  Save this article

A randomised scheme for secured modular exponentiation against power analysis attacks

Author

Listed:
  • Moushumi Barman
  • Hridoy Jyoti Mahanta

Abstract

This paper presents an approach to compute secured modular exponentiation to mitigate power analysis attacks. Two processes have been designed based on ‘multiply-always’ binary method, which injects dummy multiplications so that the original multiplications can remain intact. The two processes are being invoked based on a random variable, which generated either 0 or 1. With these randomised modular exponentiation, the proposed approach can resist simple and differential power analysis attacks to a large extent. The proposed approach has been implemented using conventional ‘squaring-multiplication’ and ‘Montgomery-Ladder’ methods. Further, the work has also been extended to CRT-RSA, which is widely used for fast computation. The proposed method has been implemented for different key sizes of 1024-bit, 1536-bit and 2048-bit RSA & CRT-RSA. The analysis and results show that with a complexity of $$O(n)$$O(n), the proposed approach can resist some of the standard DPA attacks on modular exponentiation.

Suggested Citation

  • Moushumi Barman & Hridoy Jyoti Mahanta, 2019. "A randomised scheme for secured modular exponentiation against power analysis attacks," Cyber-Physical Systems, Taylor & Francis Journals, vol. 5(4), pages 209-230, October.
  • Handle: RePEc:taf:tcybxx:v:5:y:2019:i:4:p:209-230
    DOI: 10.1080/23335777.2019.1637944
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/23335777.2019.1637944
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/23335777.2019.1637944?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.

    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:taf:tcybxx:v:5:y:2019:i:4:p:209-230. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tcyb .

    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.