Harsh Kumar Verma

Performance Analysis of RC6, Twofish and Rijndael Block Cipher Algorithms

In this paper, Performance analysis of RC6, Twofish and Rijndael block cipher algorithms have been done on the basis of execution time and resource utilization. CPU utilization and memory utilization both are considered for determining resource utilization. These algorithms are parameterized algorithm and were designed to meet the requirements of the Advanced Encryption Standard (AES) competition and selected among five finalists of that competition. These three algorithms have a variable block size and a variable key size in their structure and encrypt four w-bits at a time. Allowable choices for w are 16 bits, 32 bits, and 64 bits. Twofish and Rijndael have same structure for encryption and decryption while RC6 have different. RC6, Twofish and Rijndael have 20, 16 and 10 rounds respectively. Performances of these three algorithms have been evaluated on key size of 128-bits, 192-bit and 256-bit in this paper. General Terms Cryptography, Block cipher, Symmetric encryption, RC6, Twofish, Rijndael

Handling imprecision in inputs using fuzzy logic to predict effort in software development

Accurate, precise and reliable estimates of effort at early stages of project development holds great significance for the industry to meet the competitive demands of todays world. The inherent imprecision present in the inputs of the algorithmic models like Constructive Cost Model (COCOMO) yields imprecision in the output, resulting in erroneous effort estimation. The development of software is characterized by parameters that possess certain level of fuzziness which requires that some degree of uncertainty be introduced in the models, in order to make the models realistic. Fuzzy logic based cost estimation models enable linguistic representation of the input and output of a model to address the vagueness and imprecision in the inputs, to make reliable and accurate estimates of effort. In this paper, we present an enhanced fuzzy logic based framework for software development effort prediction. The intermediate COCOMO is extended in the proposed study by incorporating the concept of fuzziness into the measurements of size, mode of development for projects and the cost drivers contributing to the overall development effort. The said framework tolerates imprecision, incorporates experts knowledge, explains prediction rationale through rules, offers transparency in the prediction system, and could adapt to changing environments with the availability of new data.

Outlier Detection of Data in Wireless Sensor Networks Using Kernel Density Estimation

this paper, an attempt has been made to develop a statistical model for the sensor data stream, estimating density for distribution of data and flagging a particular value as an outlier in the best possible manner without compromising with the performance. A statistical modeling technique transforms the raw sensor readings into meaningful information which will yield effective output, hence offering a more reliable way to gain insight into the physical phenomena under observation. We have proposed a model that is based on the approximation of the sensor data distribution. Our approach takes into consideration various characteristics and features of streaming sensor data. We processed and evaluated our proposed scheme with a set of experiments with datasets which is taken from Intel Berkeley research lab. The experimental evaluation shows that our algorithm can achieve very high precision and recall rates for identifying outliers and demonstrate the effectiveness of the proposed approach.

A hybrid approach for image security by combining encryption and steganography

Multimedia data is more used on internet so it is desired to secure the data before transmitting. Various algorithms have been researched and proposed in this regards. This paper presents the hybrid approach for image security that combines both encryption and steganography. First the image is encrypted using proposed new version of AES algorithm, which is then hided into cover image using the steganography concept. Experimental results and analysis is shown. This hybrid approach provides greater security against attacks.

An image interpolation based reversible data hiding scheme using pixel value adjusting feature

In this paper, we propose an image interpolation based reversible data hiding scheme using pixel value adjusting feature. This scheme consists of two phases, namely: image interpolation and data hiding. In order to interpolate the original image, we propose a new image interpolation method which is based on the existing neighbor mean interpolation method. Our interpolation method takes into account all the neighboring pixels like the NMI method. However, it uses different weight-age as per their proximity. Thus, it provides the better quality interpolated image. In case of data hiding phase, secret data is embedded in the interpolated pixels in two passes. In the first pass, it embeds the secret data into the odd valued pixels and then in the second pass, the even valued pixels are used to embed the secret data. To ensure the reversibility of the proposed scheme, the location map is constructed for every pass. Basically, the proposed scheme only increases/decreases the pixel values during data hiding phase, which improves the performance of the proposed scheme in terms of computation complexity. Experimentally, our scheme is superior to the existing scheme in terms of data hiding capacity, image quality and computation complexity.

A hybrid framework for registration of carotid ultrasound images combining iconic and geometric features.

Stroke is the third major cause of death worldwide behind heart disease and cancer. Carotid atherosclerosis is the most frequent cause of ischemic stroke. Early diagnosis of carotid plaque and serial monitoring of its size with the help of imaging modalities can help to prevent the atherosclerotic complications. The main difficulty is inevitable variability of patient’s head positions during image acquisitions. The time series registration of carotid images helps to improve the monitoring, characterization, and quantification of the disease by suppressing the global movements of the patient. In this work, a novel hybrid registration technique has been proposed and evaluated for registration of carotid ultrasound images taken at different times. The proposed hybrid method bridges the gap between the feature-based and intensity-based registration methods. The feature-based iterative closest point algorithm is used to provide a coarse registration which is subsequently refined by the intensity-based algorithm. The proposed framework uses rigid transformation model coupled with mutual information (MI) similarity measure and Powell optimizer. For quantitative evaluation, different registration approaches have been compared using four error metrics: visual information fidelity, structural similarity index, correlation coefficient, and MI. Qualitative evaluation has also been done using the visual examination of the registered image pairs.

Analysis of Decision Making Operation In Cognitive Radio Using Fuzzy Logic System

Introduction of flexibility and intelligence in the wireless devices and applications have introduced the concept of Cognitive Radio. This research objective has inspired various research activities on going which included the decision making aspects. In this paper, a decision making process in cognitive radio is analyzed using fuzzy logic system, in which secondary user can use the spectrum effectively. We have selected three descriptive factors for choosing the proper secondary unlicensed user – velocity of the secondary user, spectrum to be utilized by secondary user and distance of the secondary user from primary user. The efficiency of the decision making process in cognitive radios is analyzed. Based on linguistic knowledge 27 rules are set up. The output of the fuzzy logic system gives the probability of the decision based on the three descriptive factors. We show how fuzzy logic system can be used for decision making operation in cognitive radio.

Cryptanalysis and Performance Evaluation of Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers

In these days there are plenty of signature schemes such as the threshold proxy signature scheme (Kumar and Verma 2010). The network is a shared medium so that the weakness security attacks such as eavesdropping, replay attack, and modification attack. Thus, we have to establish a common key for encrypting/decrypting our communications over an insecure network. In this scheme, a threshold proxy signature scheme based on RSA, any or more proxy signers can cooperatively generate a proxy signature while or fewer of them cannot do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers (Rivest et al., 1978). Comparison is done on the basis of time complexity, space complexity, and communication overhead. We compare the performance of four schemes (Hwang et al. (2003), Kuo and Chen (2005), Yong-Jun et al. (2007), and Li et al. (2007), with the performance of a scheme that has been proposed earlier by the authors of this paper. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks.

Comparison of various Security Protocols in RFID

Paper presents a brief overview of RFID technology and protocols used in it. The paper becomes a foot step in analysis and contrasting Kill Tag, Hash-Lock, Enhanced Hash Lock, Selective Blocker Tag, Tag Broker Model and Molnar Wagner controlled delegation on the basis of security, implementation cost and practical implementation possibility. The discussion results in a selection of protocol as per the requirement and environment of use.

Analysis and Design of Protocol for Enhanced Threshold Proxy Signature Scheme Based on RSA for Known Signers

Many threshold proxy signature schemes are proposed in which the t out of n threshold schemes are deployed; but they still lack the property of security. In this research paper, secret sharing proxy signature could permit the shares of designated signers, called proxy signers, renew their own proxy shares periodically without changing the secret. In particular, our scheme applies the (t, n) threshold proxy signature scheme and allows any t or more then t signers to form a designated group from n proxy signers to sign messages on behalf of the original signer. In the proposed scheme, furthermore, a proxy signer can recover his/her own share from t other proxy shares without revealing any information about other proxy shares. Unless more than t other proxy signers cooperate and collude, the secret share algorithm is always secure. We compare the performance of four schemes: Hwang et al., Wen et al., Geng et al. and Fengying et al. with the performance of a scheme that has been proposed by the authors of this article earlier. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks.