Piyush Kumar Shukla

Applied Cryptography Using Chaos Function for Fast Digital Logic-Based Systems in Ubiquitous Computing

Recently, chaotic dynamics-based data encryption techniques for wired and wireless networks have become a topic of active research in computer science and network security such as robotic systems, encryption, and communication. The main aim of deploying a chaos-based cryptosystem is to provide encryption with several advantages over traditional encryption algorithms such as high security, speed, and reasonable computational overheads and computational power requirements. These challenges have motivated researchers to explore novel chaos-based data encryption techniques with digital logics dealing with hiding information for fast secure communication networks. This work provides an overview of how traditional data encryption techniques are revised and improved to achieve good performance in a secure communication network environment. A comprehensive survey of existing chaos-based data encryption techniques and their application areas are presented. The comparative tables can be used as a guideline to select an encryption technique suitable for the application at hand. Based on the limitations of the existing techniques, an adaptive chaos based data encryption framework of secure communication for future research is proposed

A Survey on Sybil Attack in Vehicular Ad-hoc Network

Ad-hoc network is new and emerging technology. Researchers are gaining interest in this technology. Due to its open nature it is vulnerable to various attacks. Sybil attack is one of them. Various defense techniques have been given by researchers. In this work we briefly explain those defense techniques, given recently. We categorize these techniques as trusted certificates base, resource testing based and social network based. We give an overview of some defense schemes based on first two categories. We also give a summary of the techniques given in this paper, which is based on some parameters used in those techniques. KeywordsAd-hoc Network, Sybil Attack, Certification Authority.

Multiple Subgroup Data Compression Technique Based on Huffman Coding

There are so many records compression methods have been introduced to shrink the phrasing/data cargo space and communication costs. The intelligent compression method in this article is based on switching code information compression technique with the utility of adaptive Huffman coding. The programming development of the structure encodes usually occurring characters with shorter bit code and infrequently occurring appearing characters with longer bit codes, same code can be use for three symbols for numbers, alphabet, and special character. The decoding process regenerate the encoded data by expanding the encoded data back to the original data and works very much like the encoder process. Proposed method is more effective than Adaptive Huffman coding because it reduce the codeword length of the characters and can be use same codeword for three different groups character. Their size of the symbol-codeword table is also reduces which transmitted with the compressed data. This process enhancing compression efficiency up to 12% more than Adaptive Huffman Coding which provide compression ratio up to 52.51% (+12%). The propose system is very impressive for compressing text file, which hold numbers and special symbols approximately equi-probable to alphabets like Math’s Books/database files in a real time environment.

An Exhaustive Survey on Physical Node Capture Attack in WSN

Node capture attack is one of the most dreadful security attack exist in wireless sensor networks. An adversary steals cryptographic key information from a captured node to compromise entire network. So, Security of wireless sensor network is an important issue for maintaining confidentiality and integrity of wireless links. Now-a-days, researchers are paying attention towards developing security schemes against Node capture attack. Our survey provides deep insights of existing modeling techniques of node capture attack in wireless sensor network. It also analyzes various detection and key predistribution schemes for inventing a new scheme to improve resilience against node capture attack..

ARA MAC - A Qualifying Approach for improving Attack Resiliency and Adaptivity for Medium Access Control Protocol in WLAN 802. 11

The exponential growth of wireless network in recent years has brought some major research issues that include a fair share of the available bandwidth, quality of service (QoS) and control of misbehaving traffic nodes/sources. However, in wireless networks, including cellular, Ad Hoc, and sensor networks, that are based on a shared medium and often contention-oriented protocols, these issues have not been fully addressed. Most wireless networks are based on IEEE 802.11x standards which provide public wireless access to the Internet. The medium access control (MAC) in IEEE 802.11 uses a distributed contention resolution mechanism for sharing the channel. If the MAC protocol is manipulated or misused, then the consequences can be overwhelming, such as the disruption of the whole network. A selfish/cheater node [10] can manipulate the MAC protocol in different ways to gain access to the channel resulting in some cases of starvation of other nodes in the same network. The manipulation of the MAC layer protocol is hidden from the upper layers, and can be further enhanced if combined with more violations from these upper layers of the ISO/OSI Model. In wireless networks i.e. IEEE 802.11, all nodes contending to access the medium made-up to follow the rules of the Medium Access Control (MAC) sub layer. As the number of nodes increases; the probability of collisions obviously increases which causes longer back-off values of the collided nodes. A suspicious node may be either selfish node (or misbehaving node) which attempts to manipulate its back-off parameters of the CSMA / CA protocol to gain more and more access to the channel, hence get higher performance than their fair share. Suspicious nodes (Misbehavior Node). Which may be an attacker and can increase collisions to decrease the performance of MAC protocols by disobeying CSMA/CA or back-off rules. In this work, we discussed, analyzed and used selfish behavior by attackers to create an opportunist node. We also identified, declared and finally discard/disassociate the attacker nodes in IEEE 802.11 MAC layer environment. The Access point (AP) Allow most of the nodes offers more bandwidth (in terms of the extra number of slots to almost each node) while maintaining fairness if channel utilization is poor and this mode is called opportunist mode. The Proposed Protocol is called as the ARA-MAC. The performance of our method is evaluated through a simulation model to test efficiency. Various parameters are the basis for comparison between the implemented method and CSMA/CA. Key Performance Parameters i.e. Packet Delivery Ratio, RTS/Data Frames, Mean no. Of retry per frame have been used for comparison and performance evaluation. The results show that our proposed algorithm ARA-MAC outperforms basic CSMA/CA in terms of Attack Resiliency and Adaptability. ARA-MAC is able to detect and discard attacker nodes after identification of its maliciousness and also it provides adaptability in existing CSMA/CA. The time period for monitoring of node behavior varies according to the Fibonacci series to identify random timing attackers and also it reduces unnecessary execution of ARA-MAC algorithm at AP (Access Point). This is predominantly important in a distributed system where power consumption is a big concern especially in the case of Wireless Sensor Network. It is also important in a centralized system where constant monitoring of a large number of sources from the Access Point (AP) alone may become promptly a big burden on it. The main purpose of this work is to increase the channel utilization by offering opportunities to a node, and detect such node that is using this concept to degrade the network performance in terms of degraded channel utilization. General Terms Protocol Modification and System Development for Attack Resiliency at MAC Layer.

Comparative Analysis of Co-operative MAC Schemes

The inherent broadcast nature of wireless signals, is responsible for causing interference in various data transmissions. But, when this nature is exploited, the neighboring stations can overhear the data transmissions destined for a particular node. When these neighboring stations help the transmissions by taking a high data rate path instead of the low data rate path, then such a scheme is called a co-operative transmission scheme. The co-operative scheme always promises a higher throughput and lower delay performances. This paper throws a light on the various medium access control (MAC) cooperative protocols developed and at the end, a rigorous comparative study of the features is performed to give a better understanding.

Network Security Scheme for Wireless Sensor Networks using Efficient CSMA MAC Layer Protocol

Modern wireless communication system based on wireless sensor network is strictly depends on medium access mechanism to improve its performance. CSMA is modifying here in its CSMA/CA format and trying to enhancing its performance same as CSMA/CD has for wired network. The aim of the paper is to inform how optimization of CSMA based sensor network is possible and how we can deploy it for monitoring of different areas like deployment of bomb plantation by terrorists etc. Security requirement like confidentiality, integrity and authentication can be achieved by CBC-X that facilitates encryption/decryption and authentication of packets on a one pass operation for link layer security.

Implementation Comparison of Kerberos Passwords by RC-5 Encryption Type Analysis with RC-4 Encryption

In this paper, we will discuss how we can get Kerberos passwords by capturing a single packet, encrypted using the RC5-HMAC encryption type. We will discuss how presently existing two methods that when combined together, can reduce the time needed to crack a password redused over brute force and will propose scheme how that time can reduce more. The first method uses known text in the pre authentication phase to skip the verification section of the decryption process. The second method pre computes some of the steps of the RC5-HMAC decryption process.

A Survey for Designing Attack Resilient and Adaptive Medium Access Control Protocol for Wireless Networks

Collision leads to the development of retransmission algorithms for random access protocols. However their performance degrades in the case of malicious attacks. The need of a MAC protocol with the ability to identify threats and capability to discard these useless packet is required otherwise performance of shared medium may be degraded. We Focus Our Efforts on further improving the channel allocation scheme and include increase in data traffic due to various attacks, we have to adopt a Pattern matching approach to learn and mitigate the Attacks. An Efficient and Adaptive Medium Access Control Scheme using Pattern matching from the Attacks can be design to improve the performance of Media Access Control protocols.

An Intelligent and Fast Chaotic Encryption Using Digital Logic Circuits for Ad-Hoc and Ubiquitous Computing

Delays added by the encryption process represent an overhead for smart computing devices in ad-hoc and ubiquitous computing intelligent systems. Digital Logic Circuits are faster than other computing techniques, so these can be used for fast encryption to minimize processing delays. Chaotic Encryption is more attack-resilient than other encryption techniques. One of the most attractive properties of cryptography is known as an avalanche effect, in which two different keys produce distinct cipher text for the same information. Important properties of chaotic systems are sensitivity to initial conditions and nonlinearity, which makes two similar keys that generate different cipher text a source of confusion. In this paper a novel fast and secure Chaotic Map-based encryption technique using 2’s Compliment (CET-2C) has been proposed, which uses a logistic map which implies that a negligible difference in parameters of the map generates different cipher text. Cryptanalysis of the proposed algorithm shows the strength and security of algorithm and keys. Performance of the proposed algorithm has been analyzed in terms of running time, throughput and power consumption. It is to be shown in comparison graphs that the proposed algorithm gave better results compare to different algorithms like AES and some others.