Paper Info
Title
Parallel Strength Pareto Evolutionary Algorithm-II based Image Encryption
Abstract
In recent years, many image encryption approaches have been proposed on the basis of chaotic maps. The various types of chaotic maps such as one-dimensional and multi-dimensional have been used to generate the secret keys. Chaotic maps require some parameters and value assignment to these parameters is very crucial. Because, poor value assignments may make the chaotic map un-chaotic. Therefore, hyper-parameter tuning of chaotic maps is required. Recently, meta-heuristic based image encryption approaches have been designed by researchers to resolve this issue. However, the majority of the techniques suffer from poor computational speed and stuck in local optima problems. Therefore, in this study, a strength Pareto evolutionary algorithm-II based meta-heuristic approach is proposed to tune the hyper-parameters of the four-dimensional chaotic map. The proposed approach is also implemented in a parallel fashion to enhance the computational speed. The effectiveness of the proposed approach is evaluated through extensive experiments. Comparative analyses show that the proposed approach outperforms the competitive approaches in terms of entropy, NPCR, UACI, and PSNR by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><alternatives><tex-math notation="LaTeX">$0.9834$</tex-math><mml:math overflow="scroll"><mml:mn>0.9834</mml:mn></mml:math><inline-graphic xlink:href="IET-IPR.2019.0587.IM1.gif"/></alternatives></inline-formula> , <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><alternatives><tex-math notation="LaTeX">$ 1.0728$</tex-math><mml:math overflow="scroll"><mml:mn>1.0728</mml:mn></mml:math><inline-graphic xlink:href="IET-IPR.2019.0587.IM2.gif"/></alternatives></inline-formula> , <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><alternatives><tex-math notation="LaTeX">$ 0.9134$</tex-math><mml:math overflow="scroll"><mml:mn>0.9134</mml:mn></mml:math><inline-graphic xlink:href="IET-IPR.2019.0587.IM3.gif"/></alternatives></inline-formula> , and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><alternatives><tex-math notation="LaTeX">$ 0.8971\%$</tex-math><mml:math overflow="scroll"><mml:mn>0.8971</mml:mn><mml:mi mathvariant="normal">%</mml:mi></mml:math><inline-graphic xlink:href="IET-IPR.2019.0587.IM4.gif"/></alternatives></inline-formula> , respectively.
Year
DOI
Venue
2020
10.1049/iet-ipr.2019.0587
IET Image Processing
Keywords
DocType
Volume
chaos,cryptography,genetic algorithms,evolutionary computation,Pareto optimisation,image processing,search problems
Journal
14
Issue
ISSN
Citations 
6
1751-9659
2
PageRank 
References 
Authors
0.37
0
3
Name
Order
Citations
PageRank
Manjit Kaur1238.41
Dilbag Singh26715.16
Raminder Singh Uppal320.37