Robust Image Encryption and Zero-watermarking Scheme Using SCA and Modified Logistic Map

2021 ◽  
pp. 116193
Author(s):  
Achraf Daoui ◽  
Hicham Karmouni ◽  
Omar El ogri ◽  
Mhamed Sayyouri ◽  
Hassan Qjidaa
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Modified Logistic Map ◽  
Robust Image ◽  
Zero Watermarking ◽  
Watermarking Scheme

Fourier–Mellin moment-based intertwining map for image encryption

2018 ◽  
Vol 32 (09) ◽  
pp. 1850115 ◽  
Author(s):  
Manjit Kaur ◽  
Vijay Kumar
Keyword(s):  
Image Encryption ◽  
Logistic Map ◽  
Input Image ◽  
Nsga Ii ◽  
Mellin Moment ◽  
Secret Keys ◽  
Robust Image ◽  
Low Sensitivity ◽  
High Level ◽  
Intertwining Logistic Map

In this paper, a robust image encryption technique that utilizes Fourier–Mellin moments and intertwining logistic map is proposed. Fourier–Mellin moment-based intertwining logistic map has been designed to overcome the issue of low sensitivity of an input image. Multi-objective Non-Dominated Sorting Genetic Algorithm (NSGA-II) based on Reinforcement Learning (MNSGA-RL) has been used to optimize the required parameters of intertwining logistic map. Fourier–Mellin moments are used to make the secret keys more secure. Thereafter, permutation and diffusion operations are carried out on input image using secret keys. The performance of proposed image encryption technique has been evaluated on five well-known benchmark images and also compared with seven well-known existing encryption techniques. The experimental results reveal that the proposed technique outperforms others in terms of entropy, correlation analysis, a unified average changing intensity and the number of changing pixel rate. The simulation results reveal that the proposed technique provides high level of security and robustness against various types of attacks.

scholarly journals 3D DWT-DCT and Logistic MAP Based Robust Watermarking for Medical Volume Data

2014 ◽  
Vol 8 (1) ◽  
pp. 131-141 ◽  
Author(s):  
Jingbing Li ◽  
Yaoli Liu ◽  
Jiling Zhong
Keyword(s):  
Medical Information ◽  
Feature Vector ◽  
Logistic Map ◽  
Third Party ◽  
Volume Data ◽  
Robust Watermarking ◽  
3D Dwt ◽  
Zero Watermarking ◽  
Watermarking Scheme ◽  
Geometrical Attacks

Applying digital watermarking technique for the security protection of medical information systems is a hotspot of research in recent years. In this paper, we present a robust watermarking algorithm for medical volume data using 3D DWT-DCT and Logistic Map. After applying Logistic Map to enhance the security of watermarking, the visual feature vector of medical volume data is obtained using 3D DWT-DCT. Combining the feature vector, the third party concept and Hash function, a zero-watermarking scheme can be achieved. The proposed algorithm can mitigate the illogicality between robustness and invisibility. The experiment results show that the proposed algorithm is robust to common and geometrical attacks.

Image Encryption Algorithm Based on Substitution Principle and Shuffling Scheme

2020 ◽  
Vol 38 (3B) ◽  
pp. 98-103
Author(s):  
Atyaf S. Hamad ◽  
Alaa K. Farhan
Keyword(s):  
Image Encryption ◽  
Chaotic Map ◽  
Logistic Map ◽  
Encryption Algorithm ◽  
Second Phase ◽  
Cipher Text ◽  
The Face ◽  
Substitution Principle ◽  
2D Logistic Map ◽  
Image Encryption Algorithm

This research presents a method of image encryption that has been designed based on the algorithm of complete shuffling, transformation of substitution box, and predicated image crypto-system. This proposed algorithm presents extra confusion in the first phase because of including an S-box based on using substitution by AES algorithm in encryption and its inverse in Decryption. In the second phase, shifting and rotation were used based on secrete key in each channel depending on the result from the chaotic map, 2D logistic map and the output was processed and used for the encryption algorithm. It is known from earlier studies that simple encryption of images based on the scheme of shuffling is insecure in the face of chosen cipher text attacks. Later, an extended algorithm has been projected. This algorithm performs well against chosen cipher text attacks. In addition, the proposed approach was analyzed for NPCR, UACI (Unified Average Changing Intensity), and Entropy analysis for determining its strength.

scholarly journals Dual Zero-Watermarking Scheme for Two-Dimensional Vector Map Based on Delaunay Triangle Mesh and Singular Value Decomposition

2019 ◽  
Vol 9 (4) ◽  
pp. 642 ◽  
Author(s):  
Xu Xi ◽  
Xinchang Zhang ◽  
Weidong Liang ◽  
Qinchuan Xin ◽  
Pengcheng Zhang
Keyword(s):  
Singular Value Decomposition ◽  
Singular Value ◽  
Two Dimensional ◽  
Triangle Mesh ◽  
Vector Map ◽  
Vector Maps ◽  
Feature Sequence ◽  
Zero Watermarking ◽  
Value Decomposition ◽  
Watermarking Scheme

Digital watermarking is important for the copyright protection of electronic data, but embedding watermarks into vector maps could easily lead to changes in map precision. Zero-watermarking, a method that does not embed watermarks into maps, could avoid altering vector maps but often lack of robustness. This study proposes a dual zero-watermarking scheme that improves watermark robustness for two-dimensional (2D) vector maps. The proposed scheme first extracts the feature vertices and non-feature vertices of the vector map with the Douglas-Peucker algorithm and subsequently constructs the Delaunay Triangulation Mesh (DTM) to form a topological feature sequence of feature vertices as well as the Singular Value Decomposition (SVD) matrix to form intrinsic feature sequence of non-feature vertices. Next, zero-watermarks are obtained by executing exclusive disjunction (XOR) with the encrypted watermark image under the Arnold scramble algorithm. The experimental results show that the scheme that synthesizes both the feature and non-feature information improves the watermark capacity. Making use of complementary information between feature and non-feature vertices considerably improves the overall robustness of the watermarking scheme. The proposed dual zero-watermarking scheme combines the advantages of individual watermarking schemes and is robust against such attacks as geometric attacks, vertex attacks and object attacks.

scholarly journals Modification of the Logistic Map Using Fuzzy Numbers with Application to Pseudorandom Number Generation and Image Encryption

Entropy ◽  
2020 ◽  
Vol 22 (4) ◽  
pp. 474 ◽  
Author(s):  
Lazaros Moysis ◽  
Christos Volos ◽  
Sajad Jafari ◽  
Jesus M. Munoz-Pacheco ◽  
Jacques Kengne ◽  
...  
Keyword(s):  
Lyapunov Exponent ◽  
Image Encryption ◽  
Fuzzy Numbers ◽  
Statistical Tests ◽  
Logistic Map ◽  
Simple Rule ◽  
Pseudorandom Number ◽  
Bifurcation Diagrams ◽  
Triangular Numbers ◽  
Pseudorandom Number Generation

A modification of the classic logistic map is proposed, using fuzzy triangular numbers. The resulting map is analysed through its Lyapunov exponent (LE) and bifurcation diagrams. It shows higher complexity compared to the classic logistic map and showcases phenomena, like antimonotonicity and crisis. The map is then applied to the problem of pseudo random bit generation, using a simple rule to generate the bit sequence. The resulting random bit generator (RBG) successfully passes the National Institute of Standards and Technology (NIST) statistical tests, and it is then successfully applied to the problem of image encryption.

Sign in / Sign up

Export Citation Format

Share Document