Elliptic curve cryptography based mutual authentication protocol for low computational complexity environment

  • Authors:
  • Gyözö Gódor;Norbert Giczi;Sándor Imre

  • Affiliations:
  • Department of Telecommunications, Budapest University of Technology and Economics, Budapest, Hungary;Department of Telecommunications, Budapest University of Technology and Economics, Budapest, Hungary;Department of Telecommunications, Budapest University of Technology and Economics, Budapest, Hungary

  • Venue:
  • ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

In the last few years RFID technology widespread. This technology can be found in each field of our daily life, e.g. supply-chain management, libraries, access management etc. For the sake of small computational capacity of RFID Tags, at first, only mathematical and logical operations and lightweight authentication methods could be used. However, thanks to the evolution of RFID technology, nowadays PKI infrastructure is also usable in this environment. In this paper we present our elliptic curve cryptography based mutual authentication protocol which proofs against the well-known attacks. We give a brief comparison with other EC based protocols in the point of view of security. Moreover, we show that our protocol is better than the others in case of performance, too.