2,743 research outputs found
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algorithm
Genetic algorithms are a population-based Meta heuristics. They have been
successfully applied to many optimization problems. However, premature
convergence is an inherent characteristic of such classical genetic algorithms
that makes them incapable of searching numerous solutions of the problem
domain. A memetic algorithm is an extension of the traditional genetic
algorithm. It uses a local search technique to reduce the likelihood of the
premature convergence. The cryptanalysis of simplified data encryption standard
can be formulated as NP-Hard combinatorial problem. In this paper, a comparison
between memetic algorithm and genetic algorithm were made in order to
investigate the performance for the cryptanalysis on simplified data encryption
standard problems(SDES). The methods were tested and various experimental
results show that memetic algorithm performs better than the genetic algorithms
for such type of NP-Hard combinatorial problem. This paper represents our first
effort toward efficient memetic algorithm for the cryptanalysis of SDES.Comment: 9Page
Cryptanalysis of an Encryption Scheme Based on Blind Source Separation
Recently Lin et al. proposed a method of using the underdetermined BSS (blind
source separation) problem to realize image and speech encryption. In this
paper, we give a cryptanalysis of this BSS-based encryption and point out that
it is not secure against known/chosen-plaintext attack and chosen-ciphertext
attack. In addition, there exist some other security defects: low sensitivity
to part of the key and the plaintext, a ciphertext-only differential attack,
divide-and-conquer (DAC) attack on part of the key. We also discuss the role of
BSS in Lin et al.'s efforts towards cryptographically secure ciphers.Comment: 8 pages, 10 figures, IEEE forma
Cryptanalysis of an MPEG-Video Encryption Scheme Based on Secret Huffman Tables
This paper studies the security of a recently-proposed MPEG-video encryption
scheme based on secret Huffman tables. Our cryptanalysis shows that: 1) the key
space of the encryption scheme is not sufficiently large against
divide-and-conquer (DAC) attack and known-plaintext attack; 2) it is possible
to decrypt a cipher-video with a partially-known key, thus dramatically
reducing the complexity of the DAC brute-force attack in some cases; 3) its
security against the chosen-plaintext attack is very weak. Some experimental
results are included to support the cryptanalytic results with a brief discuss
on how to improve this MPEG-video encryption scheme.Comment: 8 pages, 4 figure
- …