IDEAS home Printed from https://ideas.repec.org/a/igg/jitn00/v13y2021i2p1-11.html
   My bibliography  Save this article

Low-Cost RFID Authentication Protocol Based on Elliptic Curve Algorithm

Author

Listed:
  • Rania Baashirah

    (University of Bridgeport, USA)

  • Abdelshakour Abuzneid

    (University of Bridgeport, USA)

  • Salah Addine Mellouki

    (University of Bridgeport, USA)

  • Zeba Siraj

    (University of Bridgeport, USA)

  • Cheng Zhan

    (University of Bridgeport, USA)

Abstract

Radio frequency identification (RFID) is the fastest growing technology in the world today. Thus, wireless communication between tags and readers became an integral part of retail products, library books, personal identifications, and healthcare. The RFID system can provide security features to the data transferred along the network to maintain data privacy, integrity, and confidentiality. Elliptic curve cryptography (ECC) is widely used in RFID authentication protocols to improve communication security. Zhao proposed an RFID authentication protocol using ECC where a unique access list for tags is generated with the reader identifier to elevate the security level. Although Zhao's protocol can withstand most of the RFID security attacks, it has a very high computation cost. The authors improve Zhao protocol and propose a new RFID authentication protocol by reducing the computation cost almost to the half of that in Zhao. The proposed protocol shows a significant improvement in the computation cost.

Suggested Citation

  • Rania Baashirah & Abdelshakour Abuzneid & Salah Addine Mellouki & Zeba Siraj & Cheng Zhan, 2021. "Low-Cost RFID Authentication Protocol Based on Elliptic Curve Algorithm," International Journal of Interdisciplinary Telecommunications and Networking (IJITN), IGI Global, vol. 13(2), pages 1-11, April.
    • Handle: RePEc:igg:jitn00:v:13:y:2021:i:2:p:1-11
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Daniel Ioan Hunyadi & Oana-Adriana Ticleanu & Nicolae Constantinescu, 2022. "Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining," Mathematics, MDPI, vol. 11(1), pages 1-14, December.

    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:jitn00:v:13:y:2021:i:2:p:1-11. 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.