Wireless Mesh Networks(WMN) is an active research topic for wireless networks designers and researchers. Routing has been studied in the last two decades in the field of optimization due to various applications in WMN. In this paper, Adaptive Genetic Algorithm (AGA) for identifying the shortest path in WMN satisfying multi- QoS measure is introduced. The proposed algorithm is adaptive in the sense that it uses various selection methods during the reproduction process and the one with the best multi- QoS measure is adopted in that generation. The multi-objective QoS measure defined as the combination of the minimum number of hops, minimum delay, and maximum bandwidth. The multi-objective optimization has been formulated and solved using weighted sum approach with Pareto optimal solution techniques. The simulation experiments have been carried out in MATLAB environment with a wireless network modeled as weighted graph of fifty nodes and node coverage equals to 200 meter, and the outcomes demonstrated that the proposed AGA performs well and finds the shortest route of the WMN proficiently, rapidly, and adapts to the dynamic nature of the wireless network and satisfying all of the constraints and objective measures imposed on the networks.

We introduce a new technique for BKZ reduction, which incorporated four improvements of BKZ 2.0 (including: sound pruning, preprocessing of local blocks, shorter enumeration radius and early-abortion). This algorithm is designed based on five claims which be verified strongly in experimental results. The main idea is that, similar to progressive BKZ which using decrement of enumeration cost after each sequence incremental reduction to augment the block size, we use the decrement of enumeration cost after each round of our algorithm to augment the success probability of bounding function. Also we discussed parallelization considerations in our technique.

In the era of virtualization, co-residency with unknown neighbours is a necessary evil and leakage of information through side-channels is an inevitable fact. Preventing this leakage of information through side-channels, while maintaining high efficiency, has become one of the most challenging parts of any implementation of the Advanced Encryption Standard (AES) that is based on the Rijndael Cipher. Exploiting the associative nature of the cache and susceptible memory access pattern, AES is proved to be vulnerable to side-channel cache-timing attacks. The reason of this vulnerability is primarily ascribed to the existence of correlation between the index Bytes of the State matrix and corresponding accessed memory blocks. In this paper, we idealized the model of cache-timing attack and proposed a way of breaking this correlation through the implementation of a Random Address Translator (RAT). The simplicity of the design architecture of RAT can make itself a good choice as a way of indexing the lookup tables for the implementers of the AES seeking resistance against side-channel cache-timing attacks.

Confidentiality calls for substantial research and development in network security and data communication. Several techniques have been proposed for the past decades to ensure secure and confidential transmission of data. Steganography is a significant method of hiding data in another media, such that it is physically and virtually invisible. It is used primarily to ensure secure communication in an indiscernible fashion so that the hidden information is not discovered at any stage. The goal is to hide the presence of secret information rather than the contents of information to avoid breaching of data confidentiality. This paper is an effort to bring about a comparison of some of the recent techniques used for steganography on the basis of embedding capacity and Peak signal to noise ratio (PSNR), Universal image quality index (UIQI), Number of pixel change rate (NPCR) and correlation. The performance metrics undertaken are robustness, security analysis and perceptual quality. The techniques were implemented in MATLAB 2013a v 8.1.0.604.

This proposed dynamic scripting language is a vital role in the complex real-time operating system to review, analysis, protect, detect & correct on data, application, network, software and hardware as per the desired manner to achieve the highest performance of the RTOS. The dynamic language is a primarily responsible for analysis of the fine tuning, performance, fault-tolerance, throughput of the system components at the right time. This research work contributes to the design and development of an automated mechanism that objective to investigate the minimal resource utilization to the robust computing services. We have to define & deployment the Unix scripting codes for real time operating system to achieve the reliability, scalability of the real-time MIMD platform. We have to run this SPL on background process to integrate with real-time hardware, software, network to facilitate to other dependants components. This dynamic code is integrating, interfacing, communicating, message passing, replicating among the several subjects and objects over a real-time operating system.