Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

A cryptanalytic attack of simplified-AES using ant colony optimization

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 9 No. 5 (2019)

DOI
10.11591/ijece.v9i5.pp4287-4295
ISSN
2722-2578, 2088-8708
Published
2019-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Ant colony Optimization is a nature-inspired meta-heuristic optimization algorithm that gained a great interest in resolution of combinatorial and numerical optimization problems in many science and engineering domains. The aim of this work was to investigate the use of Ant Colony Optimization in cryptanalysis of Simplified Advanced Encryption Standard (S-AES), using a known plaintext attack. We have defined the essential components of our algorithm such as heuristic value, fitness function and the strategy to update pheromone trails. It is shown from the experimental results that our proposed algorithm allow us to break S-AES cryptosystem after exploring a minimum search space when compared with others techniques and requiring only two plaintext-ciphertext pairs.

Collaboration network of the authors

10 authors · 17 co-authorship links · 9 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Chouaib Doukkali University
  • Mohammed V University
  • International University of Rabat
  • Université de technologie de belfort-montbéliard
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
M. ChekharChouaib Doukkali University1
Mohamed BakhouyaInternational University of Rabat1
Abdessadek AaroudChouaib Doukkali University1
Jaafar GaberUniversité de technologie de belfort-montbéliard1
Lahcen NiharmineMohammed V University1
Benaceur OuttajMohammed V University1
Rajaa SlimanChouaib Doukkali University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>A cryptanalytic attack of simplified-AES using ant colony optimization</dc:title><dc:creator>Grari, Hicham</dc:creator><dc:creator>Azouaoui, Ahmed</dc:creator><dc:creator>Zine-Dine, Khalid</dc:creator><dc:description>&lt;jats:p&gt;Ant colony Optimization is a nature-inspired meta-heuristic optimization algorithm that gained a great interest in resolution of combinatorial and numerical optimization problems in many science and engineering domains. The aim of this work was to investigate the use of Ant Colony Optimization in cryptanalysis of Simplified Advanced Encryption Standard (S-AES), using a known plaintext attack. We have defined the essential components of our algorithm such as heuristic value, fitness function and the strategy to update pheromone trails. It is shown from the experimental results that our proposed algorithm allow us to break S-AES cryptosystem after exploring a minimum search space when compared with others techniques and requiring only two plaintext-ciphertext pairs.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2019-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v9i5.pp4287-4295</dc:identifier><dc:identifier>10.11591/ijece.v9i5.pp4287-4295</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 9 No 5 (2019); 4287</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/18227/13039</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>