52 citations · 104 across the 4 of their papers we have counts for
Showing cs.CRShow all
3 papers · 1 filter
cs.CR2010★ 6 cited
Evolutionary Computation Algorithms for Cryptanalysis: A Study
Poonam Garg
The cryptanalysis of various cipher problems can be formulated as NP-Hard combinatorial problem. Solving such problems requires time and/or memory requirement which increases with…
cs.CR2010★ 52 cited
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algorithm
Poonam Garg
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent characte…
cs.CR2009★ 11 cited
Cryptanalysis of SDES via evolutionary computation techniques
Poonam Garg
The cryptanalysis of simplified data encryption standard can be formulated as NP-Hard combinatorial problem. The goal of this paper is two fold. First we want to make a study about…