A Novel Whale Optimization Algorithm for Cryptanalysis in Merkle-Hellman Cryptosystem

被引:33
作者
Abdel-Basset, Mohamed [1 ]
El-Shahat, Doaa [2 ]
El-henawy, Ibrahim [2 ]
Sangaiah, Arun Kumar [3 ]
Ahmed, Syed Hassan [4 ]
机构
[1] Zagazig Univ, Fac Comp & Informat, Dept Operat Res, Zagazig, Egypt
[2] Zagazig Univ, Fac Comp & Informat, Comp Sci Dept, El Zera Sq, Zagazig, Sharqiyah, Egypt
[3] Vellore Inst Technol, Sch Comp Sci & Engn, Vellore 632014, Tamil Nadu, India
[4] Univ Cent Florida, Dept Elect & Comp Engn, Orlando, FL 32816 USA
关键词
Whale optimization algorithm; Knapsack cipher; Subset sum problem; Public key cryptosystem; Merkle-Hellman Cryptosystem; Cryptanalysis; PARTICLE SWARM OPTIMIZATION; GENERALIZED M-SET; KNAPSACK CRYPTOSYSTEM;
D O I
10.1007/s11036-018-1005-3
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
080201 [机械制造及其自动化];
摘要
With the advance of the communication technology and the massive flow of information across the internet, it is becoming urgent to keep the confidentiality of the transmitted information. Using the internet has been extended to several fields such as e-mail, e-commerce, e-learning, health and medicine, shopping, and so on. Cryptography is the study of different techniques for securing the communication between the sender and the receiver. One of the most known cryptosystems is Merkle-Hellman Knapsack Cryptosystem (MHKC). It is one of the earliest Public Key Cryptosystem (PKC) that is used to secure the messages between the sender and the receiver. Developing a powerful cryptosystem comes after studying the fragility points of the current cryptosystems. The Whale Optimization Algorithm (WOA) is one of the most recent nature-inspired meta-heuristic optimization algorithms, which simulates the social behavior of humpback whales. WOA has validated excellent performance in solving the continuous problems and the engineering optimization problems. This paper introduces a novel Modified version of WOA (MWOA) for cryptanalysis of MHKC. The sigmoid function is used to map the continuous values into discrete one. A penalty function is added to the evaluation function to deal with the infeasible solutions. The mutation operation is employed for improving the solutions. The results show that MWOA is more effective and robust than other algorithms in the literature.
引用
收藏
页码:723 / 733
页数:11
相关论文
共 26 条
[1]
Agarwal A, 2011, INT J COMPUT SCI NET, V11, P12
[2]
A Modified Binary Particle Swarm Optimization for Knapsack Problems [J].
Bansal, Jagdish Chand ;
Deep, Kusum .
APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (22) :11042-11061
[3]
Beselia L, 2016, COMPUT SCI TELECOMMU, V48, P49
[4]
Garg P, 2006, T ENG COMPUT TECHNOL, V12, P829
[5]
Cryptanalytic Results on Knapsack Cryptosystem Using Binary Particle Swarm Optimization [J].
Jain, Ashish ;
Chaudhari, Narendra S. .
INTERNATIONAL JOINT CONFERENCE SOCO'14-CISIS'14-ICEUTE'14, 2014, 299 :375-384
[6]
Kennedy J, 1997, IEEE SYS MAN CYBERN, P4104, DOI 10.1109/ICSMC.1997.637339
[7]
Kochladze Z., 2016, Trans. Sci. Technol, V3, P291
[8]
A three-factor anonymous authentication scheme for wireless sensor networks in internet of things environments [J].
Li, Xiong ;
Niu, Jianwei ;
Kumari, Saru ;
Wu, Fan ;
Sangaiah, Arun Kumar ;
Choo, Kim-Kwang Raymond .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2018, 103 :194-204
[9]
Anonymous mutual authentication and key agreement scheme for wearable sensors in wireless body area networks [J].
Li, Xiong ;
Ibrahim, Maged Hamada ;
Kumari, Saru ;
Sangaiah, Arun Kumar ;
Gupta, Vidushi ;
Choo, Kim-Kwang Raymond .
COMPUTER NETWORKS, 2017, 129 :429-443
[10]
An enhanced smart card based remote user password authentication scheme [J].
Li, Xiong ;
Niu, Jianwei ;
Khan, Muhammad Khurram ;
Liao, Junguo .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2013, 36 (05) :1365-1371