Ant Colony Optimization for Cryptanalysis of Simplified-DES
| Autor: | Ahmed Azouaoui, Hicham Grari, Khalid Zine-Dine |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
business.industry
Computer science Ant colony optimization algorithms MathematicsofComputing_NUMERICALANALYSIS Combinatorial optimization problem Data_CODINGANDINFORMATIONTHEORY Encryption system Encryption ComputingMethodologies_ARTIFICIALINTELLIGENCE law.invention law Known-plaintext attack Key (cryptography) business Cryptanalysis Algorithm |
| Zdroj: | Advances in Intelligent Systems and Computing ISBN: 9783030120641 |
| DOI: | 10.1007/978-3-030-12065-8_11 |
| Popis: | Ant Colony Optimization is a search meta-heuristic inspired by the foraging behavior of real ant, having a very wide applicability. Especially, it can be applied to different combinatorial optimization problem. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of Simplified Data Standard Encryption (S-DES). A known Plaintext attack is used to recover the secret key requiring only two Plaintext-Ciphertext pairs. Moreover, our approach allows us to break S-DES encryption system in a minimum search space when compared with other techniques. Experimental results prove that ACO can be considered as a convincing tool to attack the key used in S-DES. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|