Secured Mutual Authentication Protocol for Radio Frequency Identification Systems
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32771
Secured Mutual Authentication Protocol for Radio Frequency Identification Systems

Authors: C. Kalamani, S. Sowmiya, S. Dheivambigai, G. Harihara Sudhan

Abstract:

Radio Frequency Identification (RFID) is a blooming technology which uses radio frequency to track the objects. This technology transmits signals between tag and reader to fetch information from the tag with a unique serial identity. Generally, the drawbacks of RFID technology are high cost, high consumption of power and weak authentication systems between a reader and a tag. The proposed protocol utilizes less dynamic power using reversible truncated multipliers which are implemented in RFID tag-reader with mutual authentication protocol system to reduce both leakage and dynamic power consumption. The proposed system was simulated using Xilinx and Cadence tools.

Keywords: Mutual authentication, protocol, reversible gates, RFID.

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 613

References:


[1] X.L. Jia, Q.Y. Feng, C.Z. Ma, “An efficient anti-collision protocol for RFID tag identification,” IEEE Communications Letters, vol.14, no.11, pp.1014-1016, 2010.
[2] K. Finkenzeller, RFID Handbook: Fundamentals and Applications in Contactless Smart Cards, Radio Frequency Identification and Near-Field Communication, New York: Wiley, 2010.
[3] Chih-Cheng Ou Yang, B.S. Prabhu, Charlie Qu, Chi-Cheng Chu, ‘Read / Write Performance for low memory passive HF RFID tag-reader system’, Journal of Theoretical and Applied Electronic Commerce Research,vol.4 ,no: 3 2009, pp-1-16.
[4] Kim. K, Kim. Z and Konidala D.M, “A simple and cost effective RFID tag–reader mutual authentication scheme”, in: Proceedings International Conference on RFID Security .year 2007, pp 141-152.
[5] Ching-Chien Yuan, Wei-Cheng Lin and Yu-Jung Huang, “Hardware Implementation of RFID Mutual Authentication Protocol”, IEEE Transactions on Industrial Electronics , vol.57,year 2010 pp 1573-1582.
[6] Chong Hee Kim and Gildas Avoine, “Mutual Distance Bounding Protocols”, IEEE Transactions on Mobile Computing, vol.12,year 2013 pp 830-839.
[7] Atkins. A, Yu. H and Md.M. Morshed, “Efficient Mutual Authentication Protocol for Radio Frequency Identification systems”, IET communications, vol.6, year 2012, pp 2715-2724.
[8] Andrew M. Klapper and Mark Goresky, “Fibonacci and Galois representation of Feedback-With-Carry Shift Registers”, IEEE Transactions on Information Theory, vol.48,year 2012, pp 2826-2836
[9] Chung Huang.Y u and Jehn-Ruey Jiang, “Ultralightweight RFID Reader-Tag Mutual Authentication”, IEEE 39th Annual International Computers, Software and Applications Conference, year 2015, pp-613- 616.
[10] Jung-Sik Cho, Sang-Soo Yeo and Sung Kwon Kim, “Securing against brute-force attack: A hash-based RFID mutual authentication protocol using a secret value, computer communications”, vol.59, year 2012,pp 391-397.
[11] Elango. S and Vijaykumar V.R, “Hardware implementation of tag reader mutual authentication for RFID systems, Integration”, the VLSI journal, vol.3(2), year 2014, pp 1-7.
[12] Elango. S, Rajasekar. S, Ramakrishnan. S and Vijaykumar V.R, “Implementation of 2^n-2^k-1 Modulo Adder Based RFID Mutual Authentication Protocol”, IEEE Transactions on Industrial Electronics year 2017.
[13] M. Perkowski, A. Al-Rabadi, P. Kerntopf, A. Buller, M. Chrzanowska-Jeske, A. Mishchenko, M. Azad Khan, A. Coppola, S. Yanushkevich, V. Shmerko and L. Jozwiak, Ageneral decomposition for reversible logic, Proc. RM’2001, Starkville, (2001) pp. 119-138.
[14] M. Perkowski and P Kerntopf, Reversible Logic. Invited tutorial, Proc. EURO-MICRO, Warsaw, Poland, (2001).
[15] H. Thapliyal and M. B. Srinivas, Novel reversible TSG gate and its application for designing reversible carry look ahead adder and other adder architectures, Proceedings of the 10th Asia-Pacific Computer Systems Architecture Conference (ACSAC 05), Lecture Notes of Computer Science, Springer-Verlag 3740 (2005) 775-786.