z-logo
open-access-imgOpen Access
A Novel Mutual RFID Authentication Protocol with Low Complexity and High Security
Author(s) -
Samad Rostampour,
Mojtaba Eslamnezhad Namin,
Mehdi Hosseinzadeh
Publication year - 2014
Publication title -
international journal of modern education and computer science
Language(s) - English
Resource type - Journals
eISSN - 2075-017X
pISSN - 2075-0161
DOI - 10.5815/ijmecs.2014.01.02
Subject(s) - computer science , computer security , encryption , mutual authentication , protocol (science) , authentication (law) , cryptography , simplicity , cryptographic protocol , key (lock) , authentication protocol , public key cryptography , identification (biology) , symmetric key algorithm , radio frequency identification , strong cryptography , computer network , medicine , alternative medicine , pathology , philosophy , botany , epistemology , biology
Radio Frequency Identification (RFID) is a method for automated identifying objects. One of the problems of this technology is its security. RFID tags include resource limitation; therefore, the system designers cannot implement complex circuits to enhance their security. Usually the symmetric and asymmetric encryption methods increase resources and cost. Because it is believed to increasing security is inconsistent with the simplicity, the researchers mostly use one-way encryption methods. In this paper, we propose a mutual authentication protocol based on public key cryptography. The used encryption method includes high security and low complexity. This protocol performs in few steps and is suitable for portable devices with power limitation. In terms of security, the proposed protocol is robust against known attacks. In addition, we prove the protocol is secure by an analytical method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom