Title: Efficient hardware implementations of QTL cipher for RFID applications

Authors: Nivedita Shrivastava; Pulkit Singh; Bibhudendra Acharya

Addresses: Department of Electronics and Communication Engineering, National Institute of Technology Raipur, Raipur-492010, India ' Department of Electronics and Communication Engineering, National Institute of Technology Raipur, Raipur-492010, India ' Department of Electronics and Communication Engineering, National Institute of Technology Raipur, Raipur-492010, India

Abstract: Extensive deployment of ubiquitous computing devices brings wide range of privacy and security issues in the low-resource domain. Various lightweight algorithms are proposed to solve security problem for these resource-constrained environments. In this work, optimised hardware implementations of lightweight block cipher QTL are proposed in order to provide security with optimum resource utilisation. In proposed reduced datapath architecture, resource utilisation is reduced and it gives good trade-off between area and performance. In proposed pipelined architecture, encryption round is divided into two sub-stages. This design methodology significantly improves the operating frequency. As a result, this design is apt for high-speed applications. Moreover, the proposed unified architecture combines three key scheduling designs into single design for QTL encryption and provides flexible security. All three architectures are extensively evaluated and compared on the basis of performance, area utilisation, energy requirement and power consumption for their implementations in different FPGA platforms.

Keywords: BRAM; block random access memory; cryptography; field programmable gate array; Feistel; lookup table; lightweight; block cipher; security; SPN; substitution-permutation network.

DOI: 10.1504/IJHPSA.2020.107173

International Journal of High Performance Systems Architecture, 2020 Vol.9 No.1, pp.1 - 10

Received: 02 Dec 2019
Accepted: 13 Dec 2019

Published online: 01 May 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article