Atal Chaudhuri

A novel security scheme for wireless adhoc network

Wireless adhoc network is autonomous, infrastructure less and may be mobile depending on its type of application. Secure transmission of information in wireless adhoc environment is an important concern. In this paper we propose to use shared cryptography to secure message communication in adhoc network. In this approach we divide any information into multiple shares and transmit the different shares via multiple disjoint paths between any pair of communicating nodes and if possible at different point of time. At the receiving end the original information is reconstructed by combining the shares received via different paths at different point of time. We have also proposed to keep redundancy in the number of shares to withstand loss of some shares due to loss in transmission or security attacks. Compared to other available schemes, it has minimal computational complexity. That makes it more effective in energy saving distributed environment where battery driven low end processors are used and security is also a major challenge.

A Dynamic Watermarking Scheme for Color Image Authentication

Image authentication has achieved a sharp attention now a day due to broad availability of internet services. Maldistribution and illegal copying of image, volatiles the authenticity of image-ownership. In this regard we’ve already proposed different fragile color image watermarking frameworks for embedding a color watermark within a color host image. In current communication we are proposing technique which will ensure the complete authentication of ownership in a dynamic manner. The proposed framework will form the watermark from the host image itself by combining the unique zone of the host image, and then it will be embedded to the host image with our already reported LSB scheme. In proposed watermarking framework, it allows a user with an appropriate secret key and a hash function to verify the authencity, integrity and ownership of an image. If a forger performs the watermark extraction with an incorrect key and inappropriate hash function, the user obtains an image that resembles noise. In this manner we are providing an integrated solution for ownership authentication where the watermark is unique for that particular host image, thus the authentication is ensured in an efficient way. At the watermark extraction end, we’ve used blind extraction method, i.e., neither the host image nor the watermark image is required at the time of watermark extraction.

A Novel Image Secret Sharing Scheme

Secret sharing is a technique for protecting sensitive data, such as cryptographic keys, precisely during transmission over internet. Well known secret sharing schemes in literature include Shamir[1], Blakley[2] and Asmuth-Bloom[3] leading to high computational complexity during both sharing and reconstructing phase and most of the popular secret sharing schemes are based on above schemes. Apart from those secret sharing technique, we are suggesting a scheme which deploys simple graphical masking, done by simple ANDing for share generation and reconstruction can be done by simple ORing the qualified set of shares. Not only that, it generates compressed shares that lead to strong protection of the secret image. Nevertheless it confirms confidentiality and integrity as well. This scheme is highly useful where low end processors are used but security is a major challenge.

An Invisible Color Watermarking Framework for Uncompressed Video Authentication

Digital video contents now become easily available through internet and various media. The ease of availability made digital video popular over analog media like film or tape. At the same time it demands a sharp attention regarding the ownership issue. The ownership and integrity can easily be violated using different video editing softwares. In this regard we are proposing a framework which is able to embed a color watermark logo into the video frames of a video content. The quality of original video doesn’t degrade, because in watermarked video, the color watermark is perceptually invisible to Human Visual System (HVS). As we are proposing blind extraction method, at the extraction end the prior knowledge of watermark or original video is not needed. The security issue is ensured with the help of a hash function and a secret key. The robustness of the proposed system is proven against different intentional attacks. Prof. Atal Chaudhuri Jadavpur University Dr. Monalisa Banerjee Techno India, Salt Lake The full text of the article is not available in the cache. Kindly refer the IJCA digital library at www.ijcaonline.org for the complete article. In case, you face problems while downloading the full-text, please send a mail to editor at editor@ijcaonline.org

Energy aware topology security scheme for mobile ad hoc network

A MANET or Mobile ad hoc network is infrastructure less and is also mobile because of the nature of the applications it is proposed for. Since ad hoc networks are dynamic by nature, they require a dynamic security solution that fits its fundamental characteristics. We have proposed a scheme that will detect and isolate the topology threats in MANET. The scheme is competent enough to reduce the false detection rate. To minimise false detection we have applied a game, which also reduces the message overhead.

Understating continuous ant colony optimization for neural network training: A case study on intelligent sensing of manhole gas components

In this work, we proposed various strategies for improving the performance of continuous ant colony optimization algorithm (ACO∗), which was used here for optimizing neural network (NN). Here, a real-world problem, that is, detection of manhole gas components, was used for case study. Manhole contains various toxic and explosive gases. Therefore, pre-detection of these toxic gases is crucial to avoid human fatality. Hence, we proposed to design an intelligent sensory system, which used a trained NN for detecting manhole gases. The training to NN was provided using dataset that was generated using laboratory tests, sensor’s data-sheets, and literature. The primary focus of this work was on the performance evaluation and improvement of ACO∗ algorithm. Hence, understanding of ACO∗ parameter tuning and enhancements of ACO∗ parameters through performance evaluation was well studied. Moreover, complexity analysis of ACO∗ was firmly addressed. We extended our article scope to cover the performance comparisons between ACO∗ and other NN training algorithms. We found that the improved ACO∗ performed best in comparison to other NN training algorithms such as backpropagation, conjugate gradient, particle swarm optimization, simulated annealing, and genetic algorithm.

A graph based algorithm to minimize total wire length in VLSI channel routing

Minimization of total (vertical) wire length is one of the most important problems in laying out blocks in VLSI physical design. Minimization of wire length not only reduces the cost of physical wiring required, but also reduces the electrical hazards of having long wires in the interconnection, power consumption, and signal propagation delays. Since the problem of computing minimum wire length routing solutions in no-dogleg, two-layer channel routing is NP-hard, it is interesting to develop heuristic algorithms that compute routing solutions of as low total (vertical) wire length as possible. In this paper we develop an efficient heuristic algorithm for appreciably reducing the total wire length in the reserved two-layer no-dogleg Manhattan channel routing model. Experimental results obtained are greatly encouraging.

A Chip-Based Watermarking Framework for Color Image Authentication for Secured Communication

Multimedia contents have received a sharp attention now a day as a result of massive development of cyber crime. Illegal replication, violation of authentication, misappropriation of digital content has achieved an enigmatic growth. In this respect we’ve already proposed different schemes for invisible watermarking for color image authentication in fragile domain. In current communication we are going to propose a chip-based framework for color image authentication in accordance with our prescribed LSB scheme. In this watermarking scheme, a secret key will be given to the user and with the help of a particular hash function the user can authenticate the ownership of an image. With the aforesaid secret key and hash function the secured communication is guaranteed. The original watermark will not be retrieved if any intruder tries to perform watermark extraction with an inappropriate key and a incorrect hash function. We named our proposed chip as BLIND CHIP, because we’ve used blind method for watermark extraction where neither the host image nor the watermark image is needed at the time of watermark extraction.

An algorithm facilitating fast BCD division on low end processors using Ancient Indian Vedic Mathematics Sutras

The last decade or two has witnessed a rapid evolution of the technological world with the introduction of fast processors loaded with higher amount of cache memories. Accordingly, the system architecture demanded better development to suit the rising demand for the technological advancements. Miniaturizations of components and VLSI integration have given rise to bulk advanced memory chips being grafted on even smaller amount of space thus giving access to higher amount of physical memory within exhaust limits of average applications. But the low end processors having limited memory still crave for fast applications, which are slowly going out of bounds for these devices due to the space and time complexity. The four elementary operations - addition, subtraction, multiplication and division form the basis for any type of application. Out of the four, the latter one, namely division, is a highly expensive and time consuming operation. This paper proposes a fast division algorithm based on Ancient Indian Vedic Mathematics Sutras for low end processors having limited memory. The novelty of the algorithm is that it requires a very small amount of memory for execution but performs the division mechanism much faster than the conventional division algorithms in literature, and is equally suitable for high end processors also. The algorithm has been tested on conventional mid range desktop processors and has furnished results with numbers having number of bits greater than 50 (15 digit numbers), the upper ceiling of computable numbers for conventional algorithms. It has been observed that the Vedic Division Algorithm can divide numbers having up to 38 digits (127 bits) in the present form, if modified it can divide even bigger numbers.

Comprehensive quantum analysis of existing four variable reversible gates

Throughout the last decade, reversible logic has been an emerging research topic. Over the years, a considerable number of application specific new reversible gates with varied characteristics have been proposed. Barring few, most of the gates lack fundamental quantum mapping in contemporary literature. This paper takes into account the four variable reversible gates those have been proposed and provides the Toffoli mapping using positive control lines. The authors optimize the designs using negative control lines wherever possible. The quantum cost, quantum gate count and two-qubit gate count required to implement those reversible gates have been provided which will set a benchmark for optimized gate choice for complex Boolean realizations. The authors also provide Hamming Distance based Complexity analysis.