Muhammad Najam-ul-Islam

RCIA: A New Ultralightweight RFID Authentication Protocol Using Recursive Hash:

RFID is one of the most protuberant systems in the field of ubiquitous computing. Since RFID tags have limited computation capabilities, numerous ultralightweight authentication protocols have been proposed to provide privacy and security. However all the previously proposed ultralightweight mutual authentication protocols have some security apprehensions and are vulnerable to various desynchronization and full disclosure attacks. This paper proposes a new ultralightweight mutual authentication protocol to provide robust confidentiality, integrity, and authentication (RCIA) in a cost effective manner. RCIA introduces a new ultralightweight primitive recursive hash, which efficiently detects the message tempering and also avoids all possible desynchronization attacks. RCIA involves only bitwise operations such as XOR, AND, left rotation, and recursive hash. Performance evaluation illustrates that RCIA requires less resources on tag in terms of on-chip memory, communication cost, and computational operations.

A New Ultralightweight RFID Authentication Protocol for Passive Low Cost Tags: KMAP

Radio Frequency IDentification (RFID) is one of the most promising identification schemes in the field of pervasive systems. Unique identification and non-line of sight capabilities make RFID systems more protuberant than its contending systems. As RFID systems incorporate wireless channel, there are some allied security threats and apprehensions to the systems from malicious adversaries. In order to make the system reliable and secure, numerous Ultralightweight Mutual Authentication Protocols (UMAPs) have been proposed which involve only simple bitwise logical operations (AND, XOR & OR etc.) in their designs. However, almost all of the previously proposed UMAPs are reported to be vulnerable against various security attacks (Desynchronization and Full disclosure attacks etc.). In this paper, we propose a new pseudo-Kasami code based Mutual Authentication Protocol (KMAP). The proposed protocol, KMAP, avoids unbalanced logical operations (OR, AND) and introduces a new Ultralightweight primitive: pseudo-Kasami code (Kc). The newly proposed primitive (pseudo-Kasami code) enhances the diffusion properties of the protocol messages and makes hamming weight of the secrets unpredictable and irreversible. The security analysis illustrates that the KMAP provides excellent protocol functionalities and is also highly resistive against all possible attacks. The performance evaluation shows that the KMAP requires fewer resources on the tag in terms of on-chip memory, communication cost and computational operations.

A new ultralightweight RFID mutual authentication protocol: SASI using recursive hash

RFID is one of the most prominent identification schemes in the field of pervasive systems. Nonline of sight capability makes RFID systems much better choice than its contended systems (such as barcode, magnetic tape, etc.). Since the RFID uses wireless channel for communication with its associated devices, there should be some optimal encryption methods to secure the communicating data from adversaries. Several researchers have proposed ultralightweight mutual authentication protocols (UMAPs) to secure the RFID systems in cost effective manner. Unfortunately most of the previously proposed UMAPs are later found to be vulnerable against various desynchronization, Denial of Service (DoS), traceability, and full disclosure attacks. In this paper, we present a more sophisticated UMAP to provide Strong Authentication and Strong Integrity (SASI) using recursive hash function. The proposed protocol incorporates only simple bitwise logical operators XOR, Rot, and nontriangular function (recursive hash) in its design, which can be efficiently implemented with a low cost passive RFID tag. The performance analysis of the protocol proves the conformation of the proposed protocol with EPC-C1G2 passive tags. In addition to privacy and security, small chip area (miniaturization) is another design constraint (which is mandatory requirement for a protocol to be considered as ultralightweight authentication protocol). We have also proposed and implemented the efficient hardware design of the proposed protocol for EPC-C1G2 tags. Both the FPGA and ASIC implementation flows have been adopted. The FPGA flow is primarily used to validate the functionality of the proposed hardware design whereas ASIC flow (using TSMC 0.35 μm library) is used to validate the gate count. To the best of our knowledge, this is the first FPGA and ASIC implementation of any ultralightweight RFID authentication protocol.

Heterogeneous Multi-ASIP and NoC-Based Architecture for Adaptive Parallel TBICM-ID-SSD

A novel multi-ASIP and network-on-chip (NoC) based flexible architecture for parallel iterative demapping with turbo decoding using signal space diversity (TBICM-ID-SSD) is presented in this brief. The proposed heterogeneous multi-ASIP architecture uses multiple instances of two types of application-specific instruction-set processor (ASIP): one dedicated for turbo decoding and the second for demodulation, besides butterfly-topology-based NoCs. This architecture presents novel and outstanding levels of flexibility and scalability in the design of advanced iterative receivers. It supports modulation schemes from BPSK to 256-QAM for any mapping style and supports 8 state single and double binary turbo codes used in 3GPP-LTE, DVB-RCS, and WiMAX. FPGA prototyping results are presented, and the extra hardware cost required to enable turbo demodulation is evaluated.

Cryptanalysis of mutual ultralightweight authentication protocols: SASI & RAPP

Radio Frequency Identification (RFID) is among the widely deployed identification scheme. Massive deploymentof RFID systems has also raised many security related issues which in return evokes the need of security algorithms and authentication protocols. To make the system practically feasible many Ultralightweight Authentication protocols have appeared in the prose, these Ultralightweight Protocols uses simple bitwise logical operations. Disastrously, all of these protocols are susceptible to the attacks. In this paper we have performeda comparative analysis (cryptanalysis) of the two protocols; Strong Authentication and Strong Integrity (SASI) and RFID Authentication Protocol based on Permutation (RAPP). Finally we have also projected a novel ultralightweight mutual authentication protocol; Advanced SASI, which combats against all possible attacks and cryptanalysis. Finally, a comparison of Advanced SASI with SASI and RAPP has also been performed to highlight robustness of the newly proposed algorithm as compare to its contending algorithms.

Low-complexity synchronization algorithms for orthogonally modulated IR-UWB systems

Timing synchronization is a major issue for any communication system since it is essential to ensure its stable operation and reliable performance. In this paper, we compare two low-complexity synchronization algorithms for impulse radio ultra-wideband (IR-UWB) system, employing orthogonal pulse shape modulation (PSM). The two widely adopted modulation schemes for IR-UWB systems are binary pulse amplitude modulation and binary pulse position modulation. However, the possibility of generating orthogonal UWB pulses in recent years has motivated the use of orthogonal PSM which is particularly attractive as high-order modulation and also due to its possible robustness against ISI, and therefore is the focus of this paper. Relying on the unique signal format, the first algorithm applies simple overlap-add operation followed by energy detection to achieve synchronization. This approach is semi non-data-aided (NDA) because a part of the signal is specifically reserved to help enable synchronization. The other algorithm, on the other hand, exploits the discriminating nature of well-designed polarity codes and employs a series of code word matching and averaging operations to achieve synchronization. This approach is full NDA as there is no need to interrupt the data transmission. Based on the judicious change in the phase of transmitted signal applied for synchronization purposes, the second algorithm can also be used to extract synchronized aggregate templates. These templates are then used in demodulation, resulting in a low-complexity non-coherent alternative to complex Rake receivers. The two compared timing algorithms rely on simple overlap-add operations and thus remain operational under practical UWB settings. Simulation results are provided to demonstrate the efficient performance of proposed timing estimators.

Efficient Hardware Implementation of KMAP+: An Ultralightweight Mutual Authentication Protocol

Internet of Things (IoTs) are becoming one of the integral parts of our lives, as all of the modern devices including pervasive systems use internet for its connectivity with the rest of the world. The Radio Frequency IDentification (RFID) provides unique identification and nonline of sight capabilities, therefore plays a very important role in development of IoTs. However, the RFID systems incorporate wireless channel for communication, therefore have some allied risks to the system from threat agents. In order to prevent the system from malicious activities in a cost effective way, numerous Ultralightweight Mutual Authentication Protocols (UMAPs) have been proposed since last decade. These UMAPs mainly involve simple bitwise logical operators such as XOR, AND, OR, etc., in their designs and can be implemented with extremely low cost RFID tags. However, most of the UMAP designers didn’t provide the proper hardware approximations of their UMAPs and presented only theoretical results which mostly mislead t...

Hardware Complexity Reduction in Universal Filtered Multicarrier Transmitter Implementation

The inclusion of machine-type communication in the 5G technology has motivated the research community to explore new derivative waveforms of orthogonal frequency division multiplexing. Filter bank multicarrier, universal filtered multicarrier (UFMC), and generalized frequency division multiplexing techniques are under evaluation with respect to their suitability to 5G requirements. In addition to acceptable spectral performance, investigation on computational complexity reduction while addressing flexibility can help in the selection of suitable waveform among multiple options available for 5G. In this regard, based on analysis of computation involved in UFMC waveform construction, few reduced complexity solution for UFMC transmitter implementations are recently proposed. However, hardware-implementation-related issues have not been discussed in detail. In this paper, we have proposed reduced complexity hardware solutions for all three constituent blocks, i.e., inverse discrete Fourier transform (IDFT), finite impulse response (FIR) filter, and spectrum shifting blocks of a UFMC transmitter. For IDFT part, a reduced complexity IFFT solution using Radix-2 decimation in a time technique is presented, where more than 42% computations can be avoided. It is also shown that how five times less number of multipliers can be used in an FIR filter to simplify filter architecture. Finally, a highly efficient method is presented to compute spectrum shifting coefficients through small sized lookup table.

Efficient Hardware Implementation of Ultralightweight RFID Mutual Authentication Protocol

Security and privacy are the two major concerns of radio-frequency identification (RFID) based identification systems. Several researchers have proposed ultralightweight mutual authentication protocols (UMAPs) to ensure the security of the low cost RFID tags in recent years. However, almost all of the previously proposed protocols have some serious security flaws and are vulnerable to various security attacks (full disclosure attack, desynchronization attack, impersonation attack, etc.). Recently, a more sophisticated and robust UMAP: Robust confidentiality integrity and authentication (RCIA)1 [U. Mujahid, M. Najam-ul-Islam and M. Ali Shami, RCIA: A new ultralightweight RFID authentication protocol using recursive hash, Int. J. Distrib. Sens. Netw. 2015 (2015) 642180] has been proposed. A new ultralightweight primitive, “recursive hash” has been used extensively in the protocol design which provides hamming weight unpredictability and irreversibility to ensure optimal security. In addition to security and...

On the Performance Assessment of the OLSR Protocol in Mobile Ad hoc Networks Using TCP and UDP

In mobile Ad-hoc networks MANETs and Vehicle Ad-hoc networks VANETs various reactive and proactive protocols may be used for the transmission of packets from one node to another. Amongst all routing protocols, Optimized Link State Routing OLSR protocol is the most prominent and widely used protocol for MANETs. This paper presents the performance evaluation of OLSR protocol for TCP and UDP traffic patterns by This work was partly supported by the NSFC under grant No. 61271246. varying parameters like node density, node speed and pause time. Under different network scenarios, the performance of OLSR has been assessed in terms of the most widely used performance metrics, such as packet loss, end-to-end delay and throughput. The results prove that TCP performs considerably well in terms of throughput, end to end delay and packet loss in different node density and mobility scenarios, while considering pause time UDP turns out to be a better choice.