Two improved metaheuristic techniques and their applications in automated cryptanalysis of knapsack cryptosystems
by Ashish Jain; Manoj Kumar Bohra
International Journal of Bio-Inspired Computation (IJBIC), Vol. 19, No. 4, 2022

Abstract: During the past decade, considerable improved versions of real particle swarm optimisation (PSO) have been proposed in the literature. However, only a few significant improved versions of binary PSO (BPSO) have been reported. For efficiently solving binary optimisation problems, this paper proposes an improved-BPSO technique in which an improved idea for updating particles' velocity is proposed. To escape from the local optimum, an on/off mutation strategy is also introduced. Thereafter, the proposed strategy is utilised to solve two reduced knapsack cryptosystems. For a fair assessment of the proposed technique two relatively new methods are also utilised, namely, novel-BPSO and modified-BPSO. This paper also proposes an improved genetic algorithm (improved-GA) for solving the considered knapsack cryptosystems. Finally, the experimental results are analysed by performing f-test and t-test. The outcomes obtained indicate that the improved-GA and improved-BPSO strategies solve the considered automated cryptanalysis problem efficiently in terms of accuracy and convergence.

Online publication date: Fri, 22-Jul-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com