Cryptanalysis of Merkle-Hellman cipher using ant colony optimization

Grari, Hicham; Lamzabi, Siham; Azouaoui, Ahmed; Zine-Dine, Khalid

doi:10.11591/ijai.v10.i2.pp490-500

Cited by 5 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, the dolphin swarm algorithm (DSA), binary firefly (BF), and binary cat swarm optimization (BCSO) have been proposed in [34][35][36] to deal with the DES cryptosystem. Tabu Search (TS) has been introduced to handle the stream ciphers (RC4, VMPC, and RC4+) in [37,38], while the Grari [39] presented an ACO algorithm-specific Merkle-Hellman cipher. In [40], the effectiveness of eight popular, newly released metaheuristic algorithms for the MHKC were examined.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On the Cryptanalysis of a Simplified AES Using a Hybrid Binary Grey Wolf Optimization

Rizk-Allah,

Abdulkader,

Elatif

et al. 2023

Mathematics

View full text Add to dashboard Cite

Cryptosystem cryptanalysis is regarded as an NP-Hard task in modern cryptography. Due to block ciphers that are part of a modern cipher and have nonlinearity and low autocorrelation in their structure, traditional techniques and brute-force attacks suffer from breaking the key presented in traditional techniques, and brute-force attacks against modern cipher S-AES (simplified-advanced encryption standard) are complex. Thus, developing robust and reliable optimization with high searching capability is essential. Motivated by this, this paper attempts to present a novel binary hybridization algorithm based on the mathematical procedures of the grey wolf optimizer (GWO) and particle swarm optimization (PSO), named BPSOGWO, to deal with the cryptanalysis of (S-AES). The proposed BPSOGWO employs a known plaintext attack that requires only one pair of plaintext–ciphertext pairs instead of other strategies that require more pairs (i.e., it reduces the number of messages needed in an attack, and secret information such as plaintext-ciphertext pairs cannot be obtained easily). The comprehensive and statistical results indicate that the BPSOGWO is more accurate and provides superior results compared to other peers, where it improved the cryptanalysis accurateness of S-AES by 82.5%, 84.79%, and 79.6% compared to PSO, GA, and ACO, respectively. Furthermore, the proposed BPSOGWO retrieves the optimal key with a significant reduction in search space compared to a brute-force attack. Experiments show that combining the suggested fitness function with HPSOGWO resulted in a 109-fold reduction in the search space. In cryptanalysis, this is a significant factor. The results prove that BPSOGWO is a promising and effective alternative to attack the key employed in the S-AES cipher.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The BGWO was developed with the binary format for feature selection problems in [39], where the grey wolf position vector is updated according to Equation ( 16) to firm the conversion from the continuous domain to the binary domain.…”

Section: Binary Gwo (Bgwo)mentioning

confidence: 99%

On the Cryptanalysis of a Simplified AES Using a Hybrid Binary Grey Wolf Optimization

Rizk-Allah,

Abdulkader,

Elatif

et al. 2023

Mathematics

View full text Add to dashboard Cite

show abstract

“…For low-density cases, attacks are given by [3,4]. Intelligent algorithms such as genetic algorithm [5,6] and ant colony algorithm [7] are also used to crack the Merkle-Hellman cryptosystem. In 2019, Liu and Bi proposed an attack based on an orthogonal lattice, whose time complexity is lower than Shamir's [8].…”

Section: Introductionmentioning

confidence: 99%

A Simple and Efficient Attack on the Merkle-Hellman Knapsack Cryptosystem

Bi,

2024

Preprint

View full text Add to dashboard Cite

The Merkle-Hellman knapsack cryptosystem was one of the two earliest public key cryptosystems, which was invented by Merkle and Hellman in 1978. One can recover the whole group of equivalent keys by using Shamir's method. The most time-consuming part of Shamir's attack is to recover the critical intermediate parameters by solving an integer programming problem with a fixed number of variables, whose worst-case complexity is exponential in the number of variables. In this paper, we present an improved algorithm to analyze the basic Merkle-Hellman public key cryptosystem. The main idea of our method is that we recover a partial super-increasing sequence as the equivalent private key, which is the main difference from Shamir's. More precisely, we first obtain a super-increasing sequence except for the first small part by invoking the LLL algorithm on a special lattice with a small dimension. After that, we can recover most part of the plaintext from the tail by solving the super-increasing knapsack method. Finally, we can recover the first part of plaintext from solving a size-reduced knapsack problem. Experimental data shows that one can recover the whole plaintext in less than 1 second on a laptop successfully for the typical parameters of the Merkle-Hellman cryptosystem, whose time complexity is reduced by a polynomial level compared with Shamir's algorithm.

show abstract

“…Encryption is a form of transforming information where the generated data cannot be detected by unauthorized persons. Decryption is a way to restore encrypted data into its original structure [1], [2]. The proper decryption key is required to reconstruct the contents of the encrypted information.…”

Section: Introductionmentioning

confidence: 99%

Signal multiple encodings by using autoencoder deep learning

Anaz

Al-Ridha²,

Al-Nima³

2023

Bulletin EEI

View full text Add to dashboard Cite

Encryption is a substantial phase in information security. It permits only approved persons to get private information. This study suggests a signal multi-encryptions system (SMES) technique for coding and decoding signals created by a deep autoencoder network (DAN). The DAN of four layers is employed for a coding package of signals multiple times before decoding or restructuring the original signals again. The suggested SMES offers a high level of security as it can produce and exploit multiple encryptions for signals. Many statistical calculations are applied to measure the reliability of the system. The outcomes are promising where noteworthy encryptions-decryptions are obtained.

show abstract

Cryptanalysis of Merkle-Hellman cipher using ant colony optimization

Cited by 5 publications

References 14 publications

On the Cryptanalysis of a Simplified AES Using a Hybrid Binary Grey Wolf Optimization

On the Cryptanalysis of a Simplified AES Using a Hybrid Binary Grey Wolf Optimization

A Simple and Efficient Attack on the Merkle-Hellman Knapsack Cryptosystem

Signal multiple encodings by using autoencoder deep learning

Contact Info

Product

Resources

About