Cryptanalysis of Vigenere Cipher using Particle Swarm Optimization with Markov chain random walk
Journal Title: International Journal on Computer Science and Engineering - Year 2013, Vol 5, Issue 5
Abstract
Vigenere cipher is a polyalphabetic substitution cipher with a very large key space. In this paper we have investigated the use of PSO for the cryptanalysis of vigenere cipher and proposed PSO with Markov chain random walk in which some of the worst particles are replaced with new better random particles to enhance the efficiency of PSO algorithm. Based on our experimental results, it is shown that the proposed algorithm is more effective than PSO for the analysis of Vigenere cipher.
Authors and Affiliations
Aditi Bhateja , Shailender Kumar , Ashok K. Bhateja
Keywords
Related Articles
- EP ID EP161761
- DOI -
- Views 111
- Downloads 0
A Scheduling Approach with Processor and Network Heterogeneity for Grid Environment
Processor heterogeneity is an important issue in grid environment. In this paper, a list based task scheduling algorithm, called “critical path scheduling with t-level” (CPST) for grid computing system is proposed. There...
Audio-Visual Based Multi-Sample Fusion to Enhance Correlation Filters Speaker Verification System
In this study, we propose a novel approach for speaker verification system that uses a spectrogram image as features and Unconstrained Minimum Average Correlation Energy (UMACE) filters as classifiers. Since speech signa...
Prediction of Association among Numerical Aptitude, Programming Skills, Trait Emotional Intelligence on Students Performance
Identifying variables that predict programming skill may help educators and employers. The employer may select potential students as employees. These variables are influenced by various factors. This paper is an attempt...
Comparative study on Relational data sets and XML data sets in J2EE system
In the real world extracting information entirely depends up on the type of the information, type of the structures used to maintain the information and type of the application programs used to extract the information. M...
A Novel Document Clustering Algorithm Using Squared Distance Optimization Through Genetic Algorithms
K-Means Algorithm is most widely used algorithms in document clustering. However, it still suffer some shortcomings like random initialization, solution converges to local minima, and empty cluster formation. Genetic alg...