Cryptanalysis of Merkle-Hellman cipher using ant colony optimization
| Autor: | Khalid Zine-Dine, Ahmed Azouaoui, Hicham Grari, Siham Lamzabi |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Meta-heuristic
Merkle-hellman Information Systems and Management Computer science Ant colony optimization algorithms MathematicsofComputing_NUMERICALANALYSIS Particle swarm optimization Social behaviour Ant colony NP-hard ComputingMethodologies_ARTIFICIALINTELLIGENCE law.invention Cryptanalysis Ant colony optimization Cipher Artificial Intelligence Control and Systems Engineering law Genetic algorithm Cryptosystem Electrical and Electronic Engineering Algorithm |
| Popis: | The Merkle-Hellman (MH) cryptosystem is one of the earliest public key cryptosystems, which is introduced by Ralph Merkle and Martin Hellman in 1978 based on an NP-hard problem, known as the subset-sum problem. Furthermore, ant colony optimization (ACO) is one of the most nature-inspired meta-heuristic optimization, which simulates the social behaviour of ant colonies. ACO has demonstrated excellent performance in solving a wide variety of complex problems. In this paper, we present a novel ant colony optimization (ACO) based attack for cryptanalysis of MH cipher algorithm, where two different search techniques are used. Moreover, experimental study is included, showing the effectiveness of the proposed attacking scheme. The results show that ACO based attack is more suitable than many other algorithms like genetic algorithm (GA) and particle swarm optimization (PSO). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|