Ajoy Kumar Khan

Differential Power Analysis: Attacks and Resisting Techniques

Differential Power Analysis (DPA) is a statistical approach to analyze the power consumption of a cryptographic system to break its security infrastructure. It has challenged the vulnerability of most of the cryptographic techniques like DES, AES, RSA etc. With DPA, attackers passively collect the power traces of the system and then make a comparative analysis with some hypothetical power traces. The analysis result having high value reveals the secret key used. This kind of attack has been explored by many researchers and has proposed techniques to make such attacks highly efficient. In this paper we present a detail on DPA along with the models and types for such attack. We also present some of the recent attack techniques as well as countermeasures on DPA.

Power analysis attack: A vulnerability to smart card security

A major breakthrough in side channel attacks came up when analysis of power consumption by a cryptographic device led to discovery of the secret key. This analysis technique popularly known as Power Analysis Attack is now one of the most volatile and successful side channel attacks. This technique uses the power consumed by a cryptographic system as the main parameter to identify the cryptographic algorithms as well as the secret key used. The power traces of the system are statistically analyzed and the correlation between these traces and the cryptographic technique is explored to break the security. This attack has been successfully carried out on various cryptographic algorithms like DES, AES, RSA and ECC which are implemented on cryptographic devices such smart cards, FPGA, DSP, ASIC etc. In this paper we present a review on the power analysis attack and its techniques. Also, a brief detail on some of the power analysis attacks on smart card and FPGA have been presented. Couple of methods to improve such attacks has also been mentioned.

Locoduo - Low Cost Dual Hop Clustering Based Routing Protocol for Wireless Sensor Network

As with the cases of other works in routing protocols of wireless sensor networks, the focus of this research is power efficiency and thus achieving increased network lifetime so that the sensor network can be used for a longer period of time. Here we proposed a all new concept of two hop low power transmission of data between the cluster head and sink in case of clustering based routing protocols and then compared the results with LEACH protocol and some of its other recent variants and obtained better performance in network lifetime. It is also seen that apart from being the most power efficient, this proposed algorithm works best as compared to others when the number of nodes deployed is less i.e. It is best suitable for low cost sensing.

Side channel attacks and their mitigation techniques

Side channel cryptanalysis is one of the most volatile fields of research in security prospects. It has proved that cryptanalysis is no more confined to its dependence on plain text or cipher text. Indeed side channel attack uses the physical characteristics of the cryptographic device to find the cryptographic algorithm used and also the secret key. It is one of the most efficient techniques and has successfully broken almost all the cryptographic algorithms today. In this paper we aim to present a review on the various side channel attacks possible. Also, the techniques proposed to mitigate such an attack have been stated.

Distance Based Multi Single Hop Low Energy Adaptive Clustering Hierarchy (MS LEACH) Routing Protocol in Wireless Sensor Network

The basic objective of Wireless Sensor Network are to strengthen the network life time by using the energy efficiently which are available in every nodes of the system. In this paper, Distance based Multi Single Hop Low Energy Adaptive Clustering Hierarchy(MS LEACH) protocol for Wireless Sensor Network is being introduced to better the safety area of the network which finally increases the survivability of the system with energy usage efficiently. It is build upon the span between cluster head(CH) and node(sink) to either go for single or Multi hop communication. Finally, the result of our simulation depicts that MS LEACH out-performed the existing system LEACH protocol.

Evaluation of Wireless Sensor Network Routing Protocols with Respect to Power Efficiency

Recent advances in the trend of development of small and powerful battery backed sensor node. These sensor nodes are deployed for various surveillance activities and thus forming a network. There has been numerous amount of research work for the development of power efficient routing protocols for the network of these limited power sensor nodes. This paper provides a survey of these routing protocols on basis and concludes with grading each protocol on energy saving.

A New Approach for Gateway-Level Load Balancing of WMNs through k-Means Clustering

Wireless mesh network (WMN) has emerged as a key technology because of their advantages over other wireless networks. Due to the dynamic infrastructure, the traffic volume of the WMN goes in an increasing order, thus balancing the load of the network becomes very crucial. Hence the problem of load balancing is addressed in this paper and for which the cluster based architecture of WMN is considered. In this architecture, a network is subdivided into clusters and each cluster contains a cluster head. Now the problem is also subdivided into the load balancing within each cluster, which is the responsibility of the cluster head. An appropriate selection of a cluster head is very important as it performs a vital role in increasing the network performance. The paper proposes a clustering method based on k-means approach to divide the network into k clusters to manage the load in small scale and hence to reduce the overall load of WMNs. The proposed approach works at the gateway level. The simulation results show that the performance of the WMNs is improved with the proposed clustering method.

Gateway-Level Load Balancing Techniques for WMN: A Comparative Study

Wireless mesh networks (WMNs) have emerged as a key technology for next-generation wireless networking, because of their advantages over other wireless networks. Due to the ever growing structure of WMN the traffic volume is expected to be very high, thus load balancing becomes a crucial part of it. Network load balancing enhances the scalability and availability of network. Load balancing can be used to extend the lifetime of a Mesh Network. Various approaches have been proposed by various researchers for load balancing between Internet Gateways (IGWs) and thus reducing the traffic congestion and improving the network performance and providing a better quality of service (QoS). This paper presents a detailed investigation on various Gateway level load balancing techniques for WMNs that have been proposed so far along with the critical comments as to which approach is better and suitable in which condition.

A new algorithm with minimum track for four layer channel routing in VLSI design

Channel routing is a key problem in VLSI physical design. The main goal of the channel routing problem is to reduce the area of an IC chip. If we concentrate on reducing track number in channel routing problem then automatically the area of an IC chip will be reduced. Here, we propose a new algorithm to reduce the number of tracks using four layers (two horizontal layers and two vertical layers). To be more specific, through this algorithm we convert a two-layer channel routing problem into a four-layer channel routing problem using HNCG and VCG of the channel. Next, we show the experimental results and graphical structure of that solution.

A new efficient layer assignment algorithm for partitioning in 3D VLSI physical design

Partitioning is a key problem in VLS I physical design. In partitioning, the circuit is partitioned into subcircuits. These sub-partitions are called blocks. In 3D partitioning, each of these blocks is assigned into one layer. Our primary goal is to minimize the interconnection between non-adjacent layers so that the wire length can be minimized. This process is called layer assignment. In this paper, first we propose a new efficient technique using adjacency matrix of a graph for layer-assignment problem. Next, we show the technique using an example. After that the implementation result is shown, and conclude the paper.