scholarly journals A Novel Hybrid Secure Image Encryption Based on Julia Set of Fractals and 3D Lorenz Chaotic Map

Entropy ◽  
2020 ◽  
Vol 22 (3) ◽  
pp. 274 ◽  
Author(s):  
Fawad Masood ◽  
Jawad Ahmad ◽  
Syed Aziz Shah ◽  
Sajjad Shaukat Jamal ◽  
Iqtadar Hussain

Chaos-based encryption schemes have attracted many researchers around the world in the digital image security domain. Digital images can be secured using existing chaotic maps, multiple chaotic maps, and several other hybrid dynamic systems that enhance the non-linearity of digital images. The combined property of confusion and diffusion was introduced by Claude Shannon which can be employed for digital image security. In this paper, we proposed a novel system that is computationally less expensive and provided a higher level of security. The system is based on a shuffling process with fractals key along with three-dimensional Lorenz chaotic map. The shuffling process added the confusion property and the pixels of the standard image is shuffled. Three-dimensional Lorenz chaotic map is used for a diffusion process which distorted all pixels of the image. In the statistical security test, means square error (MSE) evaluated error value was greater than the average value of 10000 for all standard images. The value of peak signal to noise (PSNR) was 7.69(dB) for the test image. Moreover, the calculated correlation coefficient values for each direction of the encrypted images was less than zero with a number of pixel change rate (NPCR) higher than 99%. During the security test, the entropy values were more than 7.9 for each grey channel which is almost equal to the ideal value of 8 for an 8-bit system. Numerous security tests and low computational complexity tests validate the security, robustness, and real-time implementation of the presented scheme.

2021 ◽  
pp. 2150406
Author(s):  
Wanbo Yu ◽  
Hao Wang

Chaotic map is applied to numerous research fields, such as encryption of data and information. In this paper, a novel bit-level scrambling encryption based on three-dimensional trigonometric chaotic sequence is proposed. This encryption is operated on grayscale images because pixel value of which is between 0 and 255, which can be converted into 8-bit binary number, then each image can be converted into eight binary images. Combine binary images a three-dimensional matrix as input, which have three index values width, height, and page. Generate three numbers by the chaotic sequence to locate the value of the matrix need to be changed. After the value is located, change its value 0 to 1 or 1 to 0, this is the basic encryption scheme. This paper makes a three-dimensional binary matrix with 32 images to test the encryption scheme, and get average value of images’ number of pixel change rate at 0.9603, unified averaged change intensity at 31.27%, information entropy at 7.9891, also the histograms. And correlation coefficients of each pixel from three directions are small. There are comparisons with other encryptions too. The key space of this encryption is more than 10[Formula: see text].


Author(s):  
Noor Munir ◽  
Majid Khan ◽  
Sajjad Shaukat Jamal ◽  
Mohammad Mazyad Hazzazi ◽  
Iqtadar Hussain

2013 ◽  
Vol 864-867 ◽  
pp. 2792-2798
Author(s):  
Yun Cai ◽  
Hao Li ◽  
Ming Fei Wu ◽  
Biao Yang

In view of the lack of high-precision and high-resolution texture information of three-dimensional laser point cloud, this paper proposes a fusion method of three-dimensional laser point cloud and high-resolution digital images. Firstly the point cloud is transformed to the spherical image of laser intensity by projection. Then the rigorous projection transformation relation between the external digital image and three-dimensional point cloud is constructed easily through spherical image and feature information. Finally the color information of the point cloud is given by digital images. The experiment indicates that the novel method is able to avoid the layout difficulty of control points in the field and operating the three-dimensional data of indoor work, and meanwhile achieve the control of geometric accuracy.


Author(s):  
Д.И. Прохоров ◽  
Я.В. Базайкин ◽  
В.В. Лисица

В работе предложен алгоритм редукции трехмерных цифровых изображений для ускорения вычисления персистентных диаграмм, характеризующих изменения в топологии порового пространства образцов горной породы. Воксели для удаления выбираются исходя из структуры своей окрестности, что позволяет редуцировать изображение за линейное время. Показано, что эффективность алгоритма существенно зависит от сложности устройства порового пространства и размеров шагов фильтрации. A new algorithm for the reduction of three-dimensional digital images is proposed to improve the performance of persistence diagrams computing. These diagrams represent changes in topology of the pore space in the rock matrix. The algorithm has a linear complexity, since the removal of the voxel is based on the structure of its neighborhood. It is shown that the efficiency of the algorithm depends heavily on the complexity of the pore space and the size of filtering steps.


Author(s):  
Riah Ukur Ginting ◽  
Dini M Hutagalung

The image is a function of 2 (two) dimensions f (x, y), where x and y are the coordinates that show the space, and the value of f (x, y) is called the image intensity at the coordinates. Digital image is an image that has a limited value of x, y, f (x, y). Digital images consist of a limited number of elements, where each element has coordinates and values. These elements are called pixels (Gonzalez and Woods., 2007). One method of randomization in the image is Arnold Transformation where the image is transformed using a cat map, which is a 2x2 matrix. After transformation, the value of each pixel gets new coordinates until the image does not have its original shape. As a result of the above problems, the author uses the basis of Arnold Transformation, to change the value of the map paint with Fibonacci and Lucas series for designing this application so that the randomization results have a higher level of security. The purpose of this study is (1) to do digital image randomization using Fibonacci and Lucas transforms so that the image does not have its original shape anymore and (2) save the randomized images into storage memory. The benefits of this study are (1) the design of digital image randomization applications, so that image security increases and (2) the effectiveness of the Fibonacci and lucas transformation methods in digital image randomization.Keywords: Image Processing, Fibonacci and Lucas


2015 ◽  
Vol 26 (01) ◽  
pp. 1450069 ◽  
Author(s):  
A. Martín Del Rey ◽  
G. Rodríguez Sánchez

A novel encryption algorithm to cipher digital images is presented in this work. The digital image is rendering into a three-dimensional (3D) lattice and the protocol consists of two phases: the confusion phase where 24 chaotic Cat maps are applied and the diffusion phase where a 3D cellular automata is evolved. The encryption method is shown to be secure against the most important cryptanalytic attacks.


2021 ◽  
Vol 23 (06) ◽  
pp. 1047-1054
Author(s):  
Shashikant S. Radke ◽  
◽  
Dhirendra S. Mishra ◽  

Currently, digital images are widely used in different applications to represent distinguishable contents. Also, diagnosing diseases using medical images became vital and crucial and if the data in these images are liable for unauthorized usage, this may lead to severe problems. The security of these data has become an urgent and serious problem and needs immediate attention. Traditional encryption and decryption algorithms are not sufficient to secure digital images. Especially, image encryption and decryption algorithms are needed. Securing image data with effective encryption approaches can be more useful for applications. This article aims to comparatively study the different digital image encryption algorithms. In the current Pandemic scenario of COVID-19, the variety of research work can be communicated through the encrypted images among researchers to avoid the leakage of information. These image encryption algorithms are having applications to secure image data and store and share them in the network environments.


Author(s):  
D. P. Gangwar ◽  
Anju Pathania

This work presents a robust analysis of digital images to detect the modifications/ morphing/ editing signs by using the image’s exif metadata, thumbnail, camera traces, image markers, Huffman codec and Markers, Compression signatures etc. properties. The details of the whole methodology and findings are described in the present work. The main advantage of the methodology is that the whole analysis has been done by using software/tools which are easily available in open sources.


Author(s):  
Lemcia Hutajulu ◽  
Hery Sunandar ◽  
Imam Saputra

Cryptography is used to protect the contents of information from anyone except those who have the authority or secret key to open information that has been encoded. Along with the development of technology and computers, the increase in computer crime has also increased, especially in image manipulation. There are many ways that people use to manipulate images that have a detrimental effect on others. The originality of a digital image is the authenticity of the image in terms of colors, shapes, objects and information without the slightest change from the other party. Nowadays many digital images circulating on the internet have been manipulated and even images have been used for material fraud in the competition, so we need a method that can detect the image is genuine or fake. In this study, the authors used the MD4 and SHA-384 methods to detect the originality of digital images, by using this method an image of doubtful authenticity can be found out that the image is authentic or fake.Keywords: Originality, Image, MD4 and SHA-384


Sign in / Sign up

Export Citation Format

Share Document