Anupam Jamatia

An improved data security using DNA sequencing

Data security is one of the most significant concerned areas of communications and data transmission. The concept of making secure data is to transform a plain message that is understandable by everyone into a human unreadable format or difficult to make out by encoding message using some cryptographic algorithms. Now a day, security is one of the most significant and fundamental issues of data transmission, researchers are working on the evolvement of new cryptographic algorithms. Cryptography is the process of providing security in data while transmitting over public networks by encrypting the original data or message. Data security is concerned with the areas of communication and data transmission. An efficient direction of achieving data security can be termed as DNA based Cryptography. The encryption and decryption process proposed in this paper will use the DNA sequencing string of the DNA strands. We have proposed here how the DNA sequencing can be utilized in cryptographic algorithms and how the message can be made more secure and reliable for transmitting effectively through networks. The algorithm we have proposed here is a new algorithm which has three keys for encrypting the message along with a new method of key generation and key sharing for better security aspects. The cipher text generated by the algorithm is looks similar with the bio-logical structure of the DNA strands. Unnecessary bits are padded with the cipher text in order to make it more complex to the intruders. The encryption algorithm is designed here by using the property of DNA sequencing.

A Review and Analysis of Software Complexity Metrics in Structural Testing

Software metrics is developed and used by the various software organizations for evaluating and assuring software code quality, operation, and maintenance. Software metrics measure various types of software complexity like size metrics, control flow metrics and data flow metrics. These software complexities must be continuously calculated, followed, and controlled. One of the main objectives of software metrics is that applies to a process and product metrics. It is always considered that high degree of complexity in a module is bad in comparison to a low degree of complexity in a module. Software metrics can be used in different phases of the software development lifecycle. This paper reviews the theory, called “software complexity metrics”, and analysis has been done based on static analysis. We try to evaluate and analyze different aspects of software metrics in structural testing which offers of estimating the effort needed for testing.

Scenario Based Pause Time Analysis of AODV, DSDV and DSR over CBR Connections in MANET

These Mobile Adhoc Network (MANET) is self-managing and governing network with their unique infrastructure less feature. There are many routing protocols have been proposed for the needs for research in MANET .The objective of this paper is to analyze and compare the behavior of three most popular routing protocols i.e. Ad-hoc On-demand Distance Vector (AODV), Destination-Sequenced Distance Vector routing protocol (DSDV) and Dynamic Source Routing (DSR) using Network Simulator-ns-2 which is a discrete event open source simulator targeted at wired and wireless networking research .Here evaluation based on performance metrics such as packet-delivery-fraction (PDF) ,average end-to-end delay of data packets and data packet loss by keeping different pause time.

An Analysis and Improvement of Probe-Based Algorithm for Distributed Deadlock Detection

 Abstract—In this paper we have performed an analysis of existing deadlock detection algorithm for distributed systems and did some improvement on them. The algorithm proposed in this paper is an extension of previous works with an introduction of an identity set S in the probe initiation. The rate of dependency table clearance is determined by our algorithm, and how over-killing of processes can be avoided by using one additional data-structure is also shown by our algorithm. The algorithm shows how this data-structure should be updated with probe-messages with the identity set, and how it helps in determining which process should be selected as victim for resolving the deadlock, and which entries should be cleared in the dependency table after successful detection of a deadlock. The study indicates that in this algorithm, rate of probe initiation is a dominant factor in determining system performance and rules need to be framed for determining best value of it. 

Performance Analysis of Hierarchical and Flat Network Routing Protocols in Wireless Sensor Network Using Ns-2

networks have the characteristics of fault tolerance and rapid development make them very promising in the above mentioned field. The main objective of this paper is to analyze the performance of two categories routing protocols i.e.

Collecting and Annotating Indian Social Media Code-Mixed Corpora

The pervasiveness of social media in the present digital era has empowered the ‘netizens’ to be more creative and interactive, and to generate content using free language forms that often are closer to spoken language and hence show phenomena previously mainly analysed in speech. One such phenomenon is code-mixing, which occurs when multilingual persons switch freely between the languages they have in common. Code-mixing presents many new challenges for language processing and the paper discusses some of them, taking as a starting point the problems of collecting and annotating three corpora of code-mixed Indian social media text: one corpus with English-Bengali Twitter messages and two corpora containing English-Hindi Twitter and Facebook messages, respectively. We present statistics of these corpora, discuss part-of-speech tagging of the corpora using both a coarse-grained and a fine-grained tag set, and compare their complexity to several other code-mixed corpora based on a Code-Mixing Index.

A Biometric Based Design Pattern for Implementation of a Security Conscious E-Voting System Using Cryptographic Protocols

With the recent explosion of new technologies in the field of Cryptography, there comes the need for increasing the Security of the present voting system of India. The use of cryptographic protocols as well as biometrics provides a technical response to the security flaws of the current voting system in India. Voting is an instrument of democracy that provides an official mechanism for people to express their views to the government. And e-Voting is considered as one of the most intensely debated subjects in Information Technology. Thus, the voting system should be much more secure and it should also have the stronger authentication mechanism so as to remove fraud and cheats completely from the voting process. This paper proposes and discusses the design of a secure e-voting system based on cryptographic protocols and biometrics that can replace the traditional voting system of India.