In this paper, a symmetric key block cipher cryptosystem is proposed, involving multiple two-dimensional chaotic maps and using 128-bits external secret key. Computer simulations indicate that the cipher has good diffusion and confusion properties with respect to the plaintext and the key. Moreover, it produces ciphertext with random distribution. The computation time is much less than previous related works. Theoretic analysis verifies its superiority to previous cryptosystems against different types of attacks.

Main reason for the attack being introduced to the system is because of popularity of the internet. Information security has now become a vital subject. Hence, there is an immediate need to recognize and detect the attacks. Intrusion Detection is defined as a method of diagnosing the attack and the sign of malicious activity in a computer network by evaluating the system continuously. The software that performs such task can be defined as Intrusion Detection Systems (IDS). System developed with the individual algorithms like classification, neural networks, clustering etc. gives good detection rate and less false alarm rate. Recent studies show that the cascading of multiple algorithm yields much better performance than the system developed with the single algorithm. Intrusion detection systems that uses single algorithm, the accuracy and detection rate were not up to mark. Rise in the false alarm rate was also encountered. Cascading of algorithm is performed to solve this problem. This paper represents two hybrid algorithms for developing the intrusion detection system. C4.5 decision tree and Support Vector Machine (SVM) are combined to maximize the accuracy, which is the advantage of C4.5 and diminish the wrong alarm rate which is the advantage of SVM. Results show the increase in the accuracy and detection rate and less false alarm rate.

The channel associated with the current connection serviced by a base station is changed while a call is in progress. Usually, continuous service is achieved by supporting handoff from one cell to another. It is often initiated either by crossing a cell boundary or by deterioration in quality of the signal in the current channel. The existing call is then changed to a new base station. For the traffics which are non stationary at and are away from the servicing base station, the chances of a call to be handed off are increasing. In this paper we propose a scheme MH_2S to modeling and implementing a traffic model with handoff behavior for wireless mobile networks . The simulation model MH_2S with priority is developed to investigate the performance behavior of hard handoff strategy. Novelty of the proposed model MH_2S results that it can improve call blocking rate of handoff calls. In addition to this, measurement of blocking probabilities for both originating calls and handoff calls is another impressive achievement of the model.

Linux systems use Encrypting File System (EFS) for providing confidentiality and integrity services to files stored on disk in a secure, efficient and transparent manner. Distributed encrypting file system should also provide support for secure remote access, multiuser file sharing, possible use by non-privileged users, portability, incremental backups etc. Existing kernel-space EFS designed at file system level provides all necessary features, but they are not portable and cannot be mounted by non-privileged users. Existing user-space EFS have performance limitations and does not provide support for file sharing.
Through this paper, modifications in the design and implementation of two existing user-space EFS, for performance gain and file sharing support, has been presented. Performance gain has been achieved in both the proposed approaches using fast and modern ciphers. File sharing support in proposed approaches has been provided with Public Key Infrastructure (PKI) integration using GnuPG PKI module and Linux Pluggable Authentication Module (PAM) framework. Cryptographic metadata is being stored as extended attributes in file's Access Control List (ACL) to make file sharing task easier and seamless to the end user.

This paper focuses on the multicast routing in wireless mesh networks under the 802.11s standard. This standard defines the HWMP (hybrid mesh network protocol) as the protocol of the routing but only unicast and broadcast. Such the standard defines the multicast routing as a goal among several and that the HWMP don't handle multicast messages, this reason motivates us to think about a solution to make the HWMP able to handle multicast routing. We try to resolve the problem by using the bases of MAODV (Multicast Ad-hoc on-demand Distance Vector) protocol for the reason that the HWMP is inspired from AODV (Ad-hoc On-demand Distance Vector) and the MAODV is just an extension of the AODV. The result shows that the scalability of the routing using different number of nodes in the network is excellent. For the mobility it can be agreed since the routers in mesh topology is almost static. Whereas, the rate of message control generated is still very high. In all, the HWMP become able to handle up the multicast messages.

In today's applications, evolving data streams are stored as very large databases; the databases which grow without limit at a rate of several million records per day. Data streams are ubiquitous and have become an important research topic in the last two decades. Mining these continuous data streams brings unique opportunities, but also new challenges. For their predictive nonparametric analysis, Hoeffding-based trees are often a method of choice, which offers a possibility of any-time predictions. Although one of their main problems is the delay in learning progress due to the presence of equally discriminative attributes. Options are a natural way to deal with this problem. In this paper, Option trees which build upon regular trees is presented by adding splitting options in the internal nodes to improve accuracy, stability and reduce ambiguity. Results based on accuracy and processing speed of algorithm under various memory limits is presented. The accuracy of Hoeffding Option tree with Hoeffding trees under circumstantial conditions is compared.

The biometric passports are to prevent the illegal entry of traveler into a specific country and limit the use of counterfeit documents by more accurate identification of an individual. Biometric Passports have been introduced in many countries to improve the security in Inspection Systems and enhance procedures and systems that prevent identity and passport fraud. The deployment of biometric technologies, countries need to test and evaluate its systems since the International Civil Aviation Organization (ICAO) provides the guidelines, but the implementation is up to each issuing country. The paper also provides a cryptographic security analysis of the e-passport using face fingerprint, and iris biometric that are intended to provide improved security in protecting biometric information of the e-passport bearer.

In this paper we present a work of text steganography. Now a days, maintain the security of the secret information has been a great challenge. Sender can send messages habitually through a communication channel like Internet, draws the attention of third parties, hackers and crackers, perhaps causing attempts to break and expose the unusual messages. Steganography is a promising region which is used for secured data transmission over any public media. Substantial amount of research work has been accepted by different researchers on steganography. In this paper, a text steganography procedure has been planned with the help of an Indian regional language i.e. Oriya language. Text steganography together with quantum approach based on the use of two specific characters and two special characters like invited comas (opening and closing) in Oriya language and mapping technique of quantum gate truth table have been used.