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 120
- Downloads 0
EFFICIENT MINING OF WEIGHTED QUANTITATIVE ASSOCIATION RULES AND CHARACTERIZATION OF FREQUENT ITEMSETS
In recent years, a number of association rule mining algorithms were developed. In these algorithms, two important measures viz., support count and confidence were used to generate the frequent itemsets and the correspon...
A Survey on Performance Testing Approaches of Web Application and Importance of WAN Simulation in Performance Testing
In today’s era of internet most of the applications developed are either web applications or web interface is provided to the applications. In either of the cases it’s very much critical for developers of such applicatio...
A Novel approach for identifying greedy nodes in wireless sensor network by using EEGN algorithm
WSN have attracted a great deal of research attention due to then wide range of applications. The life span of the sensor network is limited to its residual power. In order to increase the energy of the nodes it is neces...
Scalability Performance of MANET Routing Protocols with Reference to Variable Pause Time
As mobile networking continues to experience increasing popularity, the need to connect large numbers of wireless devices will become more prevalent. Many recent proposals for ad hoc routing have certain characteristics....
A surface descriptor of surface matching base on normal angle of surface data
Three dimensional surface matching is an important problem in computer vision. The process of surface matching is to match similar regions or correspondences across multiple surfaces with unknown relative poses. Many sur...