Ajay Kakkar

Digital signature verification scheme for image authentication

Image authentication is one of the security checks to detect any forgery or malicious manipulations, which may have occurred due to insecure transmission. An effective scheme is proposed in this paper which can detect the tampering and also it supports the image compression. A digital signature corresponding to the image will be transmitted along with the image itself. Receiver will regenerate the signature corresponding to the received image and if both the signatures match, it means there is no tampering of data and the received image is authentic (or original). As it allows lossy compression techniques therefore matching is done by setting some threshold value. For example with 10% tolerance if both hash files match up to 90% the image will be considered as authentic.

Optimized WDM network with consideration of lesser blocking probability & shortest path selection

In Present Era, Optical networks satisfy the requirement of high transmission bandwidth by providing several T bits/s transmissions. Need of high data rates increasing continuously as data traffic continues to increase at the rapid rate of 40 % to 70 % per year. WDM (Wavelength Division Multiplexing) based Optical networks purposes the solution to meet the demands of high bit rate and inline amplifiers to increase transmission distance in order to efficiently utilize the Fiber Capacities by dividing its huge bandwidth into a set of disjoint wavelength bands. The solution can also be cost effective as the existing physical network can be used. In this paper a Fiber Optic Simulator (FOSP) is introduced, used to optimize Physical properties of fiber in order to get high velocity. Further wavelength assignment techniques (First Fit, Random Fit) & WDM networks with wavelength conversion is analyzed in terms of their blocking probability. Analysis shows that WDM networks designed with wavelength converters gives the best performance among all the wavelength assignment techniques. A shortest path algorithm (Dijkastras algorithm) is followed in order to select shortest path among the network to speed up the data transfer.

Comparative Study of Scheduling Algorithms for Real Time Environment

is a technique which makes an arrangement of performing certain tasks at specified period. The intervals between each function have been clearly defined by the algorithm to avoid any overlapping. The real time computing systems are those in which there are strict timing constraints that have to be met to get the correct output i.e. the output not only depend on the correctness of the outcome but also on the time at which results are produced. Real time systems are expected to change its state in real time even after the controlling processor has stopped its execution. The bound in which real time applications are needed to respond to the stimuli is known as deadline. In order to achieve optimized results in a real rime operations the scheduling techniques has been used. In the paper we classify the various scheduling techniques based on different parameters. Also techniques used for scheduling in real time environment are analyzed and comparison between different techniques have been done. The various issues have been presented on which there is still a need to work.

Scheduling of Real Time Tasks

Scheduling refers to a set of policies and mechanisms supported by operating system that controls the order in which the work to be done is completed. Scheduling is the best method to improve the performance of the network by re-arranging the system parameters. The basic of need of scheduling is to keep the CPU busy as much as possible by executing a (user) process until it must wait for an event, and then switch to another process. This paper involves the various issues on which the performance of the network depends.

LSB based Steganography Techniques for Secured Communication

Steganography is a data hiding technique which is used to prevent the data or any relevant information from falling to the hands of an unauthorized personal. So, in order to prevent such scenario the steganographic method is used using LSB matching technique in which the LSB of the pixels of the cover media is replaced with that of the relevant information and the cover media is chosen based on characteristics known to only the sender and receiver and no one else can access it. The steganographic technique can find its relevance and scope in merely many field like Marketing, MNCs, Industry. The literature review has been done by keeping in mind to obtain ideas and techniques to detect and improve as much as possible to the steganographic techniques and through research and work done on MATLAB software, were able to detect LSB based steganographic encrypted image from the others. To this some remarks were added to improve the security and evident in result section.

Development of modified Pro-Energy algorithm for future solar irradiance estimation using level and trend factors in time series analysis

Modelling of solar irradiance is an imperative function for renewable energy based power systems. In the proposed work, a modified Pro-Energy algorithm is developed using level and trend factors in time series analysis for future solar irradiance. The performance of the proposed algorithm has been compared with exponentially weighted moving-average, weather conditioned moving average, and Pro-Energy on the basis of prediction error. The prediction error has been reduced up to 7.68%, 4.24%, 4.3%, and 5.84% in 30, 60, 90, and 120 min ahead of solar irradiance prediction, respectively, in comparison to the existing Pro-Energy algorithm.

Mathematical analysis and simulation of multiple keys and S-Boxes in a multinode network for secure transmission

The requirement of data security is an important parameter for all organizations for their survival in the world. Cryptography is the best method to avoid unauthorized access to data. It involves an encryption algorithm and the keys that are being used by the users. Multiple keys provide a more secure cryptographic model with a minimum number of overheads. There are various factors that affect the security pattern such as the number of keys and their length, encryption algorithm, latency, key shifting time, and users. In this paper, a new approach is proposed for generating keys from the available data. The analysis of various times, such as encryption, decryption, key setup, processing, and key shifting times, has been done. The model takes minimum time to replace the faulty keys with the fresh keys. In this paper, we consider all the above-mentioned factors and suggest an optimized way of using them.