A Scheme of Fragile Watermarking Based on SVD and 2D Chaotic Mapping

This paper proposed a novel fragile watermarking scheme based on singular value decomposition (SVD) and 2D chaotic mapping. It obtains chaotic initial values from the image blocks singular value decomposition and the user’s key, then uses the chaotic mapping to get the chaotic sequence and inserts the sequence into the LSBs of the image blocks to get the watermarked image blocks. The paper reconstructed the watermarked image from all the embedded blocks. The analysis and experimental results show that the scheme is pretty fragile to tampering, and it can localize the tampering position accurately, reach 3×3 blocks.

Color image encryption algorithm based on chaotic mapping and DNA encoding

A color image encryption method combining deoxyribonucleic(DNA)encoding and hyperchaotic mapping is proposed to solve the problems of simple structure,low complexit and low security of the existing encryption system for low-dimensional chaotic mapping encoding system and a single DNA encoding system.Firstly,according to the information of the plaintext images,the initial values of all chaotic maps and the random matrices with the same size as the plaintext images are iteratively generated.Then,the generated initial values and random matrices are divided into the sub-blocks with the same size.The DNA encoding mode of each sub-block and the DNA operation rules between the sub-blocks are determined by the dynamic hyperchaotic sequence.Finally,the diffusion operation is adopted to achieve a better encryption effect.The simulation results indicate that the proposed encryption algorithm can resist a variety of attacks due to its high complexity,strong security and large key space.

On new chaotic mappings in symbol space

A well known chaotic mapping in symbol space is a shift mapping.However,other chaotic mappings in symbol space exist too.The basic change is to consider the process not only at a set of times which are equally spaced,say at unit time apart（a shift mapping）,but at a set of times which are not equally spaced,say if the unit time can not be fixed.The increasing mapping as a generalization of the shift mapping and the k-switch mapping are introduced.The increasing and k-switch mappings are chaotic.

Design and Implementation of Image Encryption Method by Using Chaotic Mapping Based on Multi-layer Parameter Disturbance

Bit-plane decomposition makes images obtain a number of layers. According to the amount of data information, images are encrypted, and the paper proposes image encryption method with Chaotic Mapping based on multi-layer parameter disturbance. The advantage of multi-layer parameter disturbance is that it not only scrambles pixel location of images, but also changes pixel values of images. Bit-plane decomposition can increase the space of key. And using chaotic sequence generated by chaotic system with different complexities to encrypt layers with different information content can save operation time. The simulation experiments show that using chaotic mapping in image encryption method based on multi-layer parameter disturbance can cover plaintext effectively and safely, which makes it achieve ideal encryption effect.

A NOVEL RESEARCH OF CONFIDENTIAL COMMUNICATION BASED ON THE ELLIPTIC CURVE AND THE COMBINED CHAOTIC MAPPING

This letter presents a new type of chaotic encryption system based on combined chaotic mapping pseudo-random number generator, Hash table, and elliptic curve. In this program, the elliptic curve algorithm is used for the key distribution. After the linear transformation, the original chaotic sequence generated by drive system will be combined to chaotic mapping, converted to an encryption key sequence and constructed as Hash table for message authentication. The communication experiment used in the letter proves that the combination of combined chaotic encryption and conventional encryption is safe, feasible, and easy to implement by software.

Artificial rabbit optimization algorithm based on chaotic mapping and Levy flight improvement

An artificial rabbit optimization(ARO)algorithm based on chaotic mapping and Levy flight improvement is proposed,which has the advantages of good initial population quality and fast convergence compared with the traditional ARO algorithm,called CLARO.CLARO is improved by applying three methods.Chaotic mapping is introduced,which can optimize the quality of the initial population of the algorithm.Add Levy flight in the exploration phase,which can avoid the algorithm from falling into a local optimum.The threshold of the energy factor is optimized,which can better balance exploration and exploitation.The efficiency of CLARO is tested on a set of 23 benchmark function sets by comparing it with ARO and different meta-heuristics algorithms.At last,the comparison experiments conclude that all three improvement strategies enhance the performance of ARO to some extent,with Levy flight providing the most significant improvement in ARO performance.The experimental results show that CLARO has better results and faster convergence compared to other algorithms,while successfully addressing the drawbacks of ARO and being able to face more challenging problems.

Chaotic Map-Based Authentication and Key Agreement Protocol with Low-Latency for Metasystem

With the rapid advancement in exploring perceptual interactions and digital twins,metaverse technology has emerged to transcend the constraints of space-time and reality,facilitating remote AI-based collaboration.In this dynamic metasystem environment,frequent information exchanges necessitate robust security measures,with Authentication and Key Agreement(AKA)serving as the primary line of defense to ensure communication security.However,traditional AKA protocols fall short in meeting the low-latency requirements essential for synchronous interactions within the metaverse.To address this challenge and enable nearly latency-free interactions,a novel low-latency AKA protocol based on chaotic maps is proposed.This protocol not only ensures mutual authentication of entities within the metasystem but also generates secure session keys.The security of these session keys is rigorously validated through formal proofs,formal verification,and informal proofs.When confronted with the Dolev-Yao(DY)threat model,the session keys are formally demonstrated to be secure under the Real-or-Random(ROR)model.The proposed protocol is further validated through simulations conducted using VMware workstation compiled in HLPSL language and C language.The simulation results affirm the protocol’s effectiveness in resisting well-known attacks while achieving the desired low latency for optimal metaverse interactions.

Intrusion Detection Model Using Chaotic MAP for Network Coding Enabled Mobile Small Cells

Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.

VLSI Implementation of Optimized 2D SIMM Chaotic Map for Image Encryption

The current research work proposed a novel optimization-based 2D-SIMM(Two-Dimensional Sine Iterative chaotic map with infinite collapse Mod-ulation Map)model for image encryption.The proposed 2D-SIMM model is derived out of sine map and Iterative Chaotic Map with Infinite Collapse(ICMIC).In this technique,scrambling effect is achieved with the help of Chaotic Shift Transform(CST).Chaotic Shift Transform is used to change the value of pixels in the input image while the substituted value is cyclically shifted according to the chaotic sequence generated by 2D-SIMM model.These chaotic sequences,generated using 2D-SIMM model,are sensitive to initial conditions.In the proposed algorithm,these initial conditions are optimized using JAYA optimization algorithm.Correlation coefficient and entropy are considered asfitness functions in this study to evaluate the best solution for initial conditions.The simulation results clearly shows that the proposed algorithm achieved a better performance over existing algorithms.In addition,the VLSI implementation of the proposed algorithm was also carried out using Xilinx system generator.With optimization,the correlation coefficient was-0.014096 and without optimization,it was 0.002585.

Digital image encryption with chaotic map lattices

This paper proposes a secure approach for encryption and decryption of digital images with chaotic map lattices. In the proposed encryption process, eight different types of operations are used to encrypt the pixels of an image and one of them will be used for particular pixels decided by the outcome of the chaotic map lattices. To make the cipher more robust against any attacks, the secret key is modified after encrypting each block of sixteen pixels of the image. The experimental results and security analysis show that the proposed image encryption scheme achieves high security and efficiency.

A Novel Robust Watermarking Algorithm for Encrypted Medical Image Based on DTCWT-DCT and Chaotic Map

In order to solve the problem of patient information security protection in medical images,whilst also taking into consideration the unchangeable particularity of medical images to the lesion area and the need for medical images themselves to be protected,a novel robust watermarking algorithm for encrypted medical images based on dual-tree complex wavelet transform and discrete cosine transform(DTCWT-DCT)and chaotic map is proposed in this paper.First,DTCWT-DCT transformation was performed on medical images,and dot product was per-formed in relation to the transformation matrix and logistic map.Inverse transformation was undertaken to obtain encrypted medical images.Then,in the low-frequency part of the DTCWT-DCT transformation coefficient of the encrypted medical image,a set of 32 bits visual feature vectors that can effectively resist geometric attacks are found to be the feature vector of the encrypted medical image by using perceptual hashing.After that,different logistic initial values and growth parameters were set to encrypt the watermark,and zero-watermark technology was used to embed and extract the encrypted medical images by combining cryptography and third-party concepts.The proposed watermarking algorithm does not change the region of interest of medical images thus it does not affect the judgment of doctors.Additionally,the security of the algorithm is enhanced by using chaotic mapping,which is sensitive to the initial value in order to encrypt the medical image and the watermark.The simulation results show that the pro-posed algorithm has good homomorphism,which can not only protect the original medical image and the watermark information,but can also embed and extract the watermark directly in the encrypted image,eliminating the potential risk of decrypting the embedded watermark and extracting watermark.Compared with the recent related research,the proposed algorithm solves the contradiction between robustness and invisibility of the watermarking algorithm for encrypted medical images,and it has good results against both conventional attacks and geometric attacks.Under geometric attacks in particular,the proposed algorithm performs much better than existing algorithms.

Cryptanalysis and improvement of a digital image encryption method with chaotic map lattices

A digital image encryption scheme using chaotic map lattices has been proposed recently. In this paper, two fatal flaws of the cryptosystem are pointed out. According to these two drawbacks, cryptanalysts could recover the plaintext by applying the chosen plaintext attack. Therefore, the proposed cryptosystem is not secure enough to be used in the image transmission system. Experimental results show the feasibility of the attack. As a result, we make some improvements to the encryption scheme, which can completely resist our chosen plaintext attack.

Double Encryption Using Trigonometric Chaotic Map and XOR of an Image

In the most recent decades,a major number of image encryption plans have been proposed.The vast majority of these plans reached a highsecurity level;however,their moderate speeds because of their complicated processes made them of no use in real-time applications.Inspired by this,we propose another efficient and rapid image encryption plan dependent on the Trigonometric chaotic guide.In contrast to the most of current plans,we utilize this basic map to create just a couple of arbitrary rows and columns.Moreover,to additionally speed up,we raise the processing unit from the pixel level to the row/column level.The security of the new plot is accomplished through a substitution permutation network,where we apply a circular shift of rows and columns to break the solid connection of neighboring pixels.At that point,we join the XOR operation with modulo function to cover the pixels values and forestall any leaking of data.High-security tests and simulation analyses are carried out to exhibit that the scheme is very secure and exceptionally quick for real-time image processing at 80 fps(frames per second).

Generalized synchronization between different chaotic maps via dead-beat control

This paper presents a new scheme to achieve generalized synchronization（GS） between different discrete-time chaotic（hyperchaotic） systems.The approach is based on a theorem,which assures that GS is achieved when a structural condition on the considered class of response systems is satisfied.The method presents some useful features：it enables exact GS to be achieved in finite time（i.e.,dead-beat synchronization）;it is rigorous,systematic,and straightforward in checking GS;it can be applied to a wide class of chaotic maps.Some examples of GS,including the Grassi-Miller map and a recently introduced minimal 2-D quadratic map,are illustrated.

Applying and Comparison of Chaotic-Based Permutation Algorithms for Audio Encryption

This research presents,and claries the application of two permutation algorithms,based on chaotic map systems,and applied to a le of speech signals.They are the Arnold cat map-based permutation algorithm,and the Baker’s chaotic map-based permutation algorithm.Both algorithms are implemented on the same speech signal sample.Then,both the premier and the encrypted le histograms are documented and plotted.The speech signal amplitude values with time signals of the original le are recorded and plotted against the encrypted and decrypted les.Furthermore,the original le is plotted against the encrypted le,using the spectrogram frequencies of speech signals with the signal duration.These permutation algorithms are used to shufe the positions of the speech les signals’values without any changes,to produce an encrypted speech le.A comparative analysis is introduced by using some of sundry statistical and experimental analyses for the procedures of encryption and decryption,e.g.,the time of both procedures,the encrypted audio signals histogram,the correlation coefcient between specimens in the premier and encrypted signals,a test of the Spectral Distortion(SD),and the Log-Likelihood Ratio(LLR)measures.The outcomes of the different experimental and comparative studies demonstrate that the two permutation algorithms(Baker and Arnold)are sufcient for providing an efcient and reliable voice signal encryption solution.However,the Arnold’s algorithm gives better results in most cases as compared to the results of Baker’s algorithm.

Asymmetric image encryption algorithm based on a new three-dimensional improved logistic chaotic map

Based on some analyses of existing chaotic image encryption frameworks and a new designed three-dimensional improved logistic chaotic map(3D-ILM),an asymmetric image encryption algorithm using public-key Rivest–Shamir–Adleman(RSA)is presented in this paper.In the first stage,a new 3D-ILM is proposed to enhance the chaotic behavior considering analysis of time sequence,Lyapunov exponent,and Shannon entropy.In the second stage,combined with the public key RSA algorithm,a new key acquisition mathematical model(MKA)is constructed to obtain the initial keys for the 3D-ILM.Consequently,the key stream can be produced depending on the plain image for a higher security.Moreover,a novel process model(NPM)for the input of the 3D-ILM is built,which is built to improve the distribution uniformity of the chaotic sequence.In the third stage,to encrypt the plain image,a pre-process by exclusive OR(XOR)operation with a random matrix is applied.Then,the pre-processed image is performed by a permutation for rows,a downward modulo function for adjacent pixels,a permutation for columns,a forward direction XOR addition-modulo diffusion,and a backward direction XOR addition-modulo diffusion to achieve the final cipher image.Moreover,experiments show that the the proposed algorithm has a better performance.Especially,the number of pixels change rate(NPCR)is close to ideal case 99.6094%,with the unified average changing intensity(UACI)close to 33.4634%,and the information entropy(IE)close to 8.

Image encryption technique based on new two-dimensional fractional-order discrete chaotic map and Menezes–Vanstone elliptic curve cryptosystem

We propose a new fractional two-dimensional triangle function combination discrete chaotic map(2D-TFCDM)with the discrete fractional difference.Moreover,the chaos behaviors of the proposed map are observed and the bifurcation diagrams,the largest Lyapunov exponent plot,and the phase portraits are derived,respectively.Finally,with the secret keys generated by Menezes-Vanstone elliptic curve cryptosystem,we apply the discrete fractional map into color image encryption.After that,the image encryption algorithm is analyzed in four aspects and the result indicates that the proposed algorithm is more superior than the other algorithms.

A new procedure for exploring chaotic attractors in nonlinear dynamical systems under random excitations

Due to uncertain push-pull action across boundaries between different attractive domains by random excitations, attractors of a dynamical system will drift in the phase space, which readily leads to colliding and mixing with each other, so it is very difficult to identify irregular signals evolving from arbitrary initial states. Here, periodic attractors from the simple cell mapping method are further iterated by a specific Poincare map in order to observe more elaborate structures and drifts as well as possible dynamical bifurcations. The panorama of a chaotic attractor can also be displayed to a great extent by this newly developed procedure. From the positions and the variations of attractors in the phase space, the action mechanism of bounded noise excitation is studied in detail. Several numerical examples are employed to illustrate the present procedure. It is seen that the dynamical identification and the bifurcation analysis can be effectively performed by this procedure.

Inverse full state hybrid projective synchronization for chaotic maps with different dimensions

A new synchronization scheme for chaotic（hyperchaotic） maps with different dimensions is presented.Specifically,given a drive system map with dimension n and a response system with dimension m,the proposed approach enables each drive system state to be synchronized with a linear response combination of the response system states.The method,based on the Lyapunov stability theory and the pole placement technique,presents some useful features：（i） it enables synchronization to be achieved for both cases of n 〈 m and n 〉 m;（ii） it is rigorous,being based on theorems;（iii） it can be readily applied to any chaotic（hyperchaotic） maps defined to date.Finally,the capability of the approach is illustrated by synchronization examples between the two-dimensional H′enon map（as the drive system） and the three-dimensional hyperchaotic Wang map（as the response system）,and the three-dimensional H′enon-like map（as the drive system） and the two-dimensional Lorenz discrete-time system（as the response system）.

Securing 3D Point and Mesh Fog Data Using Novel Chaotic Cat Map

With the rapid evolution of Internet technology,fog computing has taken a major role in managing large amounts of data.The major concerns in this domain are security and privacy.Therefore,attaining a reliable level of confidentiality in the fog computing environment is a pivotal task.Among different types of data stored in the fog,the 3D point and mesh fog data are increasingly popular in recent days,due to the growth of 3D modelling and 3D printing technologies.Hence,in this research,we propose a novel scheme for preserving the privacy of 3D point and mesh fog data.Chaotic Cat mapbased data encryption is a recently trending research area due to its unique properties like pseudo-randomness,deterministic nature,sensitivity to initial conditions,ergodicity,etc.To boost encryption efficiency significantly,in this work,we propose a novel Chaotic Cat map.The sequence generated by this map is used to transform the coordinates of the fog data.The improved range of the proposed map is depicted using bifurcation analysis.The quality of the proposed Chaotic Cat map is also analyzed using metrics like Lyapunov exponent and approximate entropy.We also demonstrate the performance of the proposed encryption framework using attacks like brute-force attack and statistical attack.The experimental results clearly depict that the proposed framework produces the best results compared to the previous works in the literature.