271 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
Breaking of Simplified Data Encryption Standard using Genetic Algorithm
Cryptanalysis of ciphertext by using evolutionary algorithm has gained so much interest in recent years. In this paper we have used a Genetic algorithm with improved crossover operator (Ring Crossover) for cryptanalysis of SDES. There so many attacks in cryptography. The cipher text attack only is considered here and several keys are generated in the different run of the genetic algorithm on the basis of their cost function value which depends upon frequency of the letters. The results on the S-DES indicate that, this is a promising method and can be adopted to handle other complex block ciphers like DES, AES
Modern and Lightweight Component-based Symmetric Cipher Algorithms: A Review
Information security, being one of the corner stones of network and communication technology, has been evolving tremendously to cope with the parallel evolution of network security threats. Hence, cipher algorithms in the core of the information security process have more crucial role to play here, with continuous need for new and unorthodox designs to meet the increasing complexity of the applications environment that keep offering challenges to the current existing cipher algorithms. The aim of this review is to present symmetric cipher main components, the modern and lightweight symmetric cipher algorithms design based on the components that utilized in cipher design, highlighting the effect of each component and the essential component among them, how the modern cipher has modified to lightweight cipher by reducing the number and size of these components, clarify how these components give the strength for symmetric cipher versus asymmetric of cipher. Moreover, a new classification of cryptography algorithms to four categories based on four factors is presented. Finally, some modern and lightweight symmetric cipher algorithms are selected, presented with a comparison between them according to their components by taking into considerations the components impact on security, performance, and resource requirements
Optimization of SM4 Encryption Algorithm for Power Metering Data Transmission
This study focuses on enhancing the security of the SM4 encryption algorithm for power metering data transmission by employing hybrid algorithms to optimize its substitution box (S-box). A multi-objective fitness function is constructed to evaluate the S-box structure, aiming to identify design solutions that satisfy differential probability, linear probability, and non-linearity balance. To achieve global optimization and local search for the S-box, a hybrid algorithm model that combines genetic algorithm and simulated annealing is introduced. This approach yields significant improvements in optimization effects and increased non-linearity. Experimental results demonstrate that the optimized S-box significantly reduces differential probability and linear probability while increasing non-linearity to 112. Furthermore, a comparison of the ciphertext entropy demonstrates enhanced encryption security with the optimized S-box. This research provides an effective method for improving the performance of the SM4 encryption algorithm
An evolutionary computation attack on one-round TEA
AbstractIn this work, one-round Tiny Encryption Algorithm (TEA) is attacked with an Evolutionary Computation method inspired by a combination of Genetic Algorithm (GA) and Harmony Search (HS). The system presented evaluates and evolves a population of candidate keys and compares paintext-ciphertext pairs of the known key against said population. We verify that randomly generated keys are the hardest to derive. Keys composed of words containing all on-bits are more difficult to break than keys composed of words containing all off-bits. Keys which have repeated words are easiest to derive. Finally, the present EC strategy is capable of deriving degenerate keys; this is most evident when keys are front loaded so that the first byte of each word has the highest density of on-bits
Cryptanalysis of the Purple Cipher using Random Restarts
Cryptanalysis is the process of trying to analyze ciphers, cipher text, and crypto systems, which may exploit any loopholes or weaknesses in the systems, leading us to an understanding of the key used to encrypt the data. This project uses Expectation Maximization (EM) approach using numerous restarts to attack decipherment problems such as the Purple Cipher. In this research, we perform cryptanalysis of the Purple cipher using genetic algorithms and hidden Markov models (HMM). If the Purple cipher has a fixed plugboard, we show that genetic algorithms are successful in retrieving the plaintext from cipher text with high accuracy. On the other hand, if the cipher has a plugboard that is not fixed, we can decrypt the cipher text with increasing accuracy given an increase in population size and restarts. We performed the cryptanalysis of PseudoPurple, which is less complex but more powerful than Purple using HMMs. Though we could not decrypt cipher text produced by PseudoPurple with good accuracy, there is an increase in accuracy of the decrypted plaintext with an increase in the number of restarts
- …