Cryptanalysis of SDES via evolutionary computation techniques

Details Cryptanalysis of SDES via evolutionary computation techniques Cryptanalysis of SDES via evolutionary computation techniques

2009-06-28

arxiv.org/abs/0906.5123v1

IJCSIS May 2009 Issue, Vol. 1, No. 1

Computer Science

Cryptography and Security

7 Pages, International Journal of Computer Science and Information Security (IJCSIS)

Scientific paper

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 how evolutionary computation techniques can efficiently solve the NP-Hard combinatorial problem. For achieving this goal we test several evolutionary computation techniques like memetic algorithm, genetic algorithm and simulated annealing for the cryptanalysis of simplified data encryption standard problem (SDES). And second was a comparison between memetic algorithm, genetic algorithm and simulated annealing were made in order to investigate the performance for the cryptanalysis on SDES. The methods were tested and extensive computational results show that memetic algorithm performs better than genetic algorithms and simulated annealing for such type of NP-Hard combinatorial problem. This paper represents our first effort toward efficient memetic algorithm for the cryptanalysis of SDES.

Affiliated with

Also associated with

No associations

Rating

Cryptanalysis of SDES via evolutionary computation techniques does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cryptanalysis of SDES via evolutionary computation techniques, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptanalysis of SDES via evolutionary computation techniques will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180567