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...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.展开更多
In three-party password authenticated key exchange （AKE） protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, su...In three-party password authenticated key exchange （AKE） protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, such a protocol may suffer the password guessing attacks and the server has to maintain the password table. To eliminate the shortages of password- based AKE protocol, very recently, according to chaotic maps, Lee et al. [2015 Nonlinear Dyn. 79 2485] proposed a first three-party-authenticated key exchange scheme without using passwords, and claimed its security by providing a well- organized BAN logic test. Unfortunately, their protocol cannot resist impersonation attack, which is demonstrated in the present paper. To overcome their security weakness, by using chaotic maps, we propose a biometrics-based anonymous three-party AKE protocol with the same advantages. Further, we use the pi calculus-based formal verification tool ProVerif to show that our AKE protocol achieves authentication, security and anonymity, and an acceptable efficiency.展开更多
Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Att...Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Attari M A 2014 ＂An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps＂, Nonlinear Dynamics 77（7）： 399-411] proposed a three-party key agreement protocol by using the extended chaotic maps. They claimed that their protocol could achieve strong security. In the present paper, we analyze Farash et al.＇s protocol and point out that this protocol is vulnerable to off-line password guessing attack and suffers communication burden. To handle the issue, we propose an efficient three-party password-based key agreement protocol using extended chaotic maps, which uses neither symmetric cryptosystems nor the server＇s public key. Compared with the relevant schemes, our protocol provides better performance in terms of computation and communication. Therefore, it is suitable for practical applications.展开更多
Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly...Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.展开更多
The commercialization of the fifth-generation(5G)wireless network has begun.Massive devices are being integrated into 5G-enabled wireless sensor networks(5GWSNs)to deliver a variety of valuable services to network use...The commercialization of the fifth-generation(5G)wireless network has begun.Massive devices are being integrated into 5G-enabled wireless sensor networks(5GWSNs)to deliver a variety of valuable services to network users.However,there are rising fears that 5GWSNs will expose sensitive user data to new security vulnerabilities.For secure end-to-end communication,key agreement and user authentication have been proposed.However,when billions of massive devices are networked to collect and analyze complex user data,more stringent security approaches are required.Data integrity,nonrepudiation,and authentication necessitate special-purpose subtree-based signature mechanisms that are pretty difficult to create in practice.To address this issue,this work provides an efficient,provably secure,lightweight subtreebased online/offline signature procedure(SBOOSP)and its aggregation(Agg-SBOOSP)for massive devices in 5G WSNs using conformable chaotic maps.The SBOOSP enables multi-time offline storage access while reducing processing time.As a result,the signer can utilize the pre-stored offline information in polynomial time.This feature distinguishes our presented SBOOSP from previous online/offline-signing procedures that only allow for one signature.Furthermore,the new procedure supports a secret key during the pre-registration process,but no secret key is necessary during the offline stage.The suggested SBOOSP is secure in the logic of unforgeability on the chosen message attack in the random oracle.Additionally,SBOOSP and Agg-SBOOSP had the lowest computing costs compared to other contending schemes.Overall,the suggested SBOOSP outperforms several preliminary security schemes in terms of performance and computational overhead.展开更多
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 ...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）.展开更多
We investigate the motion of the globally coupled maps （logistic map） with a constant force. It is shown that the constant force can cause multi-synchronization for the globally coupled chaotic maps studied by us.
Ensuring the integrity and confidentiality of patient medical information is a critical priority in the healthcare sector.In the context of security,this paper proposes a novel encryption algorithm that integrates Blo...Ensuring the integrity and confidentiality of patient medical information is a critical priority in the healthcare sector.In the context of security,this paper proposes a novel encryption algorithm that integrates Blockchain technology,aiming to improve the security and privacy of transmitted data.The proposed encryption algorithm is a block-cipher image encryption scheme based on different chaotic maps:The logistic Map,the Tent Map,and the Henon Map used to generate three encryption keys.The proposed block-cipher system employs the Hilbert curve to perform permutation while a generated chaos-based S-Box is used to perform substitution.Furthermore,the integration of a Blockchain-based solution for securing data transmission and communication between nodes and authenticating the encrypted medical image’s authenticity adds a layer of security to our proposed method.Our proposed cryptosystem is divided into two principal modules presented as a pseudo-random number generator(PRNG)used for key generation and an encryption and decryption system based on the properties of confusion and diffusion.The security analysis and experimental tests for the proposed algorithm show that the average value of the information entropy of the encrypted images is 7.9993,the Number of Pixels Change Rate(NPCR)values are over 99.5%and the Unified Average Changing Intensity(UACI)values are greater than 33%.These results prove the strength of our proposed approach,demonstrating that it can significantly enhance the security of encrypted images.展开更多
This paper proposes a universal impulse-function-based method for extending discrete chaotic maps,enabling flexible construction of multicavity chaotic attractors.The proposed method achieves one-directional(1D)/two-d...This paper proposes a universal impulse-function-based method for extending discrete chaotic maps,enabling flexible construction of multicavity chaotic attractors.The proposed method achieves one-directional(1D)/two-directional(2D)extensions without introducing additional nonlinear terms or altering system stability.Theoretically,the cavity quantity in arbitrary directions is controlled by adjusting impulse levels N,while the amplitude regulation is implemented through modifications to the proportionality parameter r.Theoretical analyses,including Lyapunov exponents(LEs)and bifurcation diagrams,are conducted,confirming that the extended maps retain the intrinsic dynamics of five rational map classes.The field-programmable gate array(FPGA)implementation results are consistent with the numerical simulation results,verifying the correctness of the theoretical analysis.The method enables the expansion of unipolar attractors and enhances entropy metrics,offering a robust framework for applications in secure communication,encryption,and chaos-based technologies.展开更多
The article proposes a new algorithm to improve the security of image encryption based on twodimensional chaotic maps.Chaotic maps are often used in encrypting images.However,the encryption has periodicity,no diffusio...The article proposes a new algorithm to improve the security of image encryption based on twodimensional chaotic maps.Chaotic maps are often used in encrypting images.However,the encryption has periodicity,no diffusion,and at the same time,the real keys space of encryption are fewer than the theoretical keys space,which consequently results in potential security problems.Thus,this article puts forward several ways to solve the problems including adding diffusion mechanism,changing the design of keys and developing a composite encryption system.It designs an algorithm for the version B of the discretized baker map,which is one of the most prevalent chaotic maps,based on which a new image encryption is proposed to avoid the above problems.The simulation results show that the new encryption algorithm is valid and the result can be applied to other two-dimensional chaotic maps,such as the cat map.展开更多
Ensuring information security in the quantum era is a growing challenge due to advancements in cryptographic attacks and the emergence of quantum computing.To address these concerns,this paper presents the mathematica...Ensuring information security in the quantum era is a growing challenge due to advancements in cryptographic attacks and the emergence of quantum computing.To address these concerns,this paper presents the mathematical and computer modeling of a novel two-dimensional(2D)chaotic system for secure key generation in quantum image encryption(QIE).The proposed map employs trigonometric perturbations in conjunction with rational-saturation functions and hence,named as Trigonometric-Rational-Saturation(TRS)map.Through rigorous mathematical analysis and computational simulations,the map is extensively evaluated for bifurcation behaviour,chaotic trajectories,and Lyapunov exponents.The security evaluation validates the map’s non-linearity,unpredictability,and sensitive dependence on initial conditions.In addition,the proposed TRS map has further been tested by integrating it in a QIE scheme.The QIE scheme first quantum-encodes the classic image using the Novel Enhanced Quantum Representation(NEQR)technique,the TRS map is used for the generation of secure diffusion key,which is XOR-ed with the quantum-ready image to obtain the encrypted images.The security evaluation of the QIE scheme demonstrates superior security of the encrypted images in terms of statistical security attacks and also against Differential attacks.The encrypted images exhibit zero correlation and maximum entropy with demonstrating strong resilience due to 99.62%and 33.47%results for Number of Pixels Change Rate(NPCR)and Unified Average Changing Intensity(UACI).The results validate the effectiveness of TRS-based quantum encryption scheme in securing digital images against emerging quantum threats,making it suitable for secure image encryption in IoT and edge-based applications.展开更多
Fractional discrete systems can enable the modeling and control of the complicated processes more adaptable through the concept of versatility by providing systemdynamics’descriptions withmore degrees of freedom.Nume...Fractional discrete systems can enable the modeling and control of the complicated processes more adaptable through the concept of versatility by providing systemdynamics’descriptions withmore degrees of freedom.Numerical approaches have become necessary and sufficient to be addressed and employed for benefiting from the adaptability of such systems for varied applications.A variety of fractional Layla and Majnun model(LMM)system kinds has been proposed in the current work where some of these systems’key behaviors are addressed.In addition,the necessary and sufficient conditions for the stability and asymptotic stability of the fractional dynamic systems are investigated,as a result of which,the necessary requirements of the LMM to achieve constant and asymptotically steady zero resolutions are provided.As a special case,when Layla and Majnun have equal feelings,we propose an analysis of the system in view of its equilibrium and fixed point sets.Considering that the system has marginal stability if its eigenvalues have both negative and zero real portions,it is demonstrated that the system neither converges nor diverges to a steady trajectory or equilibrium point.It,rather,continues to hover along the line separating stability and instability based on the fractional LMM system.展开更多
This research study aims to enhance the optimization performance of a newly emerged Aquila Optimization algorithm by incorporating chaotic sequences rather than using uniformly generated Gaussian random numbers.This w...This research study aims to enhance the optimization performance of a newly emerged Aquila Optimization algorithm by incorporating chaotic sequences rather than using uniformly generated Gaussian random numbers.This work employs 25 different chaotic maps under the framework of Aquila Optimizer.It considers the ten best chaotic variants for performance evaluation on multidimensional test functions composed of unimodal and multimodal problems,which have yet to be studied in past literature works.It was found that Ikeda chaotic map enhanced Aquila Optimization algorithm yields the best predictions and becomes the leading method in most of the cases.To test the effectivity of this chaotic variant on real-world optimization problems,it is employed on two constrained engineering design problems,and its effectiveness has been verified.Finally,phase equilibrium and semi-empirical parameter estimation problems have been solved by the proposed method,and respective solutions have been compared with those obtained from state-of-art optimizers.It is observed that CH01 can successfully cope with the restrictive nonlinearities and nonconvexities of parameter estimation and phase equilibrium problems,showing the capabilities of yielding minimum prediction error values of no more than 0.05 compared to the remaining algorithms utilized in the performance benchmarking process.展开更多
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...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.展开更多
Farmland Fertility Algorithm(FFA)is a recent nature-inspired metaheuristic algorithm for solving optimization problems.Nevertheless,FFA has some drawbacks:slow convergence and imbalance of diversification(exploration)...Farmland Fertility Algorithm(FFA)is a recent nature-inspired metaheuristic algorithm for solving optimization problems.Nevertheless,FFA has some drawbacks:slow convergence and imbalance of diversification(exploration)and intensification(exploitation).An adaptive mechanism in every algorithm can achieve a proper balance between exploration and exploitation.The literature shows that chaotic maps are incorporated into metaheuristic algorithms to eliminate these drawbacks.Therefore,in this paper,twelve chaotic maps have been embedded into FFA to find the best numbers of prospectors to increase the exploitation of the best promising solutions.Furthermore,the Quasi-Oppositional-Based Learning(QOBL)mechanism enhances the exploration speed and convergence rate;we name a CQFFA algorithm.The improvements have been made in line with the weaknesses of the FFA algorithm because the FFA algorithm has fallen into the optimal local trap in solving some complex problems or does not have sufficient ability in the intensification component.The results obtained show that the proposed CQFFA model has been significantly improved.It is applied to twenty-three widely-used test functions and compared with similar state-of-the-art algorithms statistically and visually.Also,the CQFFA algorithm has evaluated six real-world engineering problems.The experimental results showed that the CQFFA algorithm outperforms other competitor algorithms.展开更多
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 o...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.展开更多
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 med...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.展开更多
Chaotic cryptography has been applied to image encryption;however,only the traditional low-dimensional chaotic systems has been widely analyzed or deciphered,which does not show satisfied security and efficiency.To so...Chaotic cryptography has been applied to image encryption;however,only the traditional low-dimensional chaotic systems has been widely analyzed or deciphered,which does not show satisfied security and efficiency.To solve this problem,a new algorithm based on cross-chaos map has been created in this article.The image pixels are scrambled under control of high-dimensional chaotic sequence,which is generated by cross chaotic map.The image pixels are substituted by ciphertext feedback algorithm.It can relate encryption required parameters with plaintext and can make a plaintext byte affect more ciphertext bytes.Proved by theoretical analysis and experimental results,the algorithm has higher complex degree and has passed SP800-22 pseudo-random number standard tests,and it has high encryption speed,high security,etc.It can be widely applied in the field of image encryption.展开更多
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 recove...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.展开更多
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 ...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.展开更多
文摘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.
基金supported by the Natural Science Foundation of Zhejiang Province,China(Grant No.LZ12F02005)the Major State Basic Research Development Program of China(Grant No.2013CB834205)the National Natural Science Foundation of China(Grant No.61070153)
文摘In three-party password authenticated key exchange （AKE） protocol, since two users use their passwords to establish a secure session key over an insecure communication channel with the help of the trusted server, such a protocol may suffer the password guessing attacks and the server has to maintain the password table. To eliminate the shortages of password- based AKE protocol, very recently, according to chaotic maps, Lee et al. [2015 Nonlinear Dyn. 79 2485] proposed a first three-party-authenticated key exchange scheme without using passwords, and claimed its security by providing a well- organized BAN logic test. Unfortunately, their protocol cannot resist impersonation attack, which is demonstrated in the present paper. To overcome their security weakness, by using chaotic maps, we propose a biometrics-based anonymous three-party AKE protocol with the same advantages. Further, we use the pi calculus-based formal verification tool ProVerif to show that our AKE protocol achieves authentication, security and anonymity, and an acceptable efficiency.
基金Project supported by the National Natural Science Foundation of China(Grant No.61462033)
文摘Three-party password-based key agreement protocols allow two users to authenticate each other via a public channel and establish a session key with the aid of a trusted server. Recently, Farash et al. [Farash M S, Attari M A 2014 ＂An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps＂, Nonlinear Dynamics 77（7）： 399-411] proposed a three-party key agreement protocol by using the extended chaotic maps. They claimed that their protocol could achieve strong security. In the present paper, we analyze Farash et al.＇s protocol and point out that this protocol is vulnerable to off-line password guessing attack and suffers communication burden. To handle the issue, we propose an efficient three-party password-based key agreement protocol using extended chaotic maps, which uses neither symmetric cryptosystems nor the server＇s public key. Compared with the relevant schemes, our protocol provides better performance in terms of computation and communication. Therefore, it is suitable for practical applications.
文摘Internet of Things(IoT)applications can be found in various industry areas,including critical infrastructure and healthcare,and IoT is one of several technological developments.As a result,tens of billions or possibly hundreds of billions of devices will be linked together.These smart devices will be able to gather data,process it,and even come to decisions on their own.Security is the most essential thing in these situations.In IoT infrastructure,authenticated key exchange systems are crucial for preserving client and data privacy and guaranteeing the security of data-in-transit(e.g.,via client identification and provision of secure communication).It is still challenging to create secure,authenticated key exchange techniques.The majority of the early authenticated key agreement procedure depended on computationally expensive and resource-intensive pairing,hashing,or modular exponentiation processes.The focus of this paper is to propose an efficient three-party authenticated key exchange procedure(AKEP)using Chebyshev chaotic maps with client anonymity that solves all the problems mentioned above.The proposed three-party AKEP is protected from several attacks.The proposed three-party AKEP can be used in practice for mobile communications and pervasive computing applications,according to statistical experiments and low processing costs.To protect client identification when transferring data over an insecure public network,our three-party AKEP may also offer client anonymity.Finally,the presented procedure offers better security features than the procedures currently available in the literature.
基金We extend our gratitude to the Deanship of Scientific Research at King Khalid University for funding this work through the research groups programunder grant number R.G.P.1/72/42The work of Agbotiname Lucky Imoize is supported by the Nigerian Petroleum Technology Development Fund(PTDF)and the German Academic Exchange Service(DAAD)through the Nigerian-German Postgraduate Program under Grant 57473408.
文摘The commercialization of the fifth-generation(5G)wireless network has begun.Massive devices are being integrated into 5G-enabled wireless sensor networks(5GWSNs)to deliver a variety of valuable services to network users.However,there are rising fears that 5GWSNs will expose sensitive user data to new security vulnerabilities.For secure end-to-end communication,key agreement and user authentication have been proposed.However,when billions of massive devices are networked to collect and analyze complex user data,more stringent security approaches are required.Data integrity,nonrepudiation,and authentication necessitate special-purpose subtree-based signature mechanisms that are pretty difficult to create in practice.To address this issue,this work provides an efficient,provably secure,lightweight subtreebased online/offline signature procedure(SBOOSP)and its aggregation(Agg-SBOOSP)for massive devices in 5G WSNs using conformable chaotic maps.The SBOOSP enables multi-time offline storage access while reducing processing time.As a result,the signer can utilize the pre-stored offline information in polynomial time.This feature distinguishes our presented SBOOSP from previous online/offline-signing procedures that only allow for one signature.Furthermore,the new procedure supports a secret key during the pre-registration process,but no secret key is necessary during the offline stage.The suggested SBOOSP is secure in the logic of unforgeability on the chosen message attack in the random oracle.Additionally,SBOOSP and Agg-SBOOSP had the lowest computing costs compared to other contending schemes.Overall,the suggested SBOOSP outperforms several preliminary security schemes in terms of performance and computational overhead.
文摘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）.
基金supported by National Natural Science of Foundation of China under Grant No.10375009)SRF for ROCS,SEM,and by K.C.Wong Magna Fund in Ningbo University
文摘We investigate the motion of the globally coupled maps （logistic map） with a constant force. It is shown that the constant force can cause multi-synchronization for the globally coupled chaotic maps studied by us.
基金supported by the Large Group Project under grant number(RGP2/473/46).
文摘Ensuring the integrity and confidentiality of patient medical information is a critical priority in the healthcare sector.In the context of security,this paper proposes a novel encryption algorithm that integrates Blockchain technology,aiming to improve the security and privacy of transmitted data.The proposed encryption algorithm is a block-cipher image encryption scheme based on different chaotic maps:The logistic Map,the Tent Map,and the Henon Map used to generate three encryption keys.The proposed block-cipher system employs the Hilbert curve to perform permutation while a generated chaos-based S-Box is used to perform substitution.Furthermore,the integration of a Blockchain-based solution for securing data transmission and communication between nodes and authenticating the encrypted medical image’s authenticity adds a layer of security to our proposed method.Our proposed cryptosystem is divided into two principal modules presented as a pseudo-random number generator(PRNG)used for key generation and an encryption and decryption system based on the properties of confusion and diffusion.The security analysis and experimental tests for the proposed algorithm show that the average value of the information entropy of the encrypted images is 7.9993,the Number of Pixels Change Rate(NPCR)values are over 99.5%and the Unified Average Changing Intensity(UACI)values are greater than 33%.These results prove the strength of our proposed approach,demonstrating that it can significantly enhance the security of encrypted images.
基金supported by the National Natural Science Foundation of China(Grant No.62001391)the Guangdong Basic and Applied Basic Research Foundation(Grant No.2024A1515010308)+1 种基金the Natural Science Basic Research Program of Shaanxi(Grant No.2024JC-YBQN-0464)the Scientific Research Program Funded by Education Department of Shaanxi Provincial Government(Grant No.24JK0559).
文摘This paper proposes a universal impulse-function-based method for extending discrete chaotic maps,enabling flexible construction of multicavity chaotic attractors.The proposed method achieves one-directional(1D)/two-directional(2D)extensions without introducing additional nonlinear terms or altering system stability.Theoretically,the cavity quantity in arbitrary directions is controlled by adjusting impulse levels N,while the amplitude regulation is implemented through modifications to the proportionality parameter r.Theoretical analyses,including Lyapunov exponents(LEs)and bifurcation diagrams,are conducted,confirming that the extended maps retain the intrinsic dynamics of five rational map classes.The field-programmable gate array(FPGA)implementation results are consistent with the numerical simulation results,verifying the correctness of the theoretical analysis.The method enables the expansion of unipolar attractors and enhances entropy metrics,offering a robust framework for applications in secure communication,encryption,and chaos-based technologies.
基金supported by the National Natural Science Foundation of China (Grant No.60474016)the Scientific Research Foundation of Hunan Provincial Education Department (No.08B015).
文摘The article proposes a new algorithm to improve the security of image encryption based on twodimensional chaotic maps.Chaotic maps are often used in encrypting images.However,the encryption has periodicity,no diffusion,and at the same time,the real keys space of encryption are fewer than the theoretical keys space,which consequently results in potential security problems.Thus,this article puts forward several ways to solve the problems including adding diffusion mechanism,changing the design of keys and developing a composite encryption system.It designs an algorithm for the version B of the discretized baker map,which is one of the most prevalent chaotic maps,based on which a new image encryption is proposed to avoid the above problems.The simulation results show that the new encryption algorithm is valid and the result can be applied to other two-dimensional chaotic maps,such as the cat map.
基金funded by Deanship of Research and Graduate Studies at King Khalid University.The authors extend their appreciation to the Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Group Project under grant number(RGP.2/556/45).
文摘Ensuring information security in the quantum era is a growing challenge due to advancements in cryptographic attacks and the emergence of quantum computing.To address these concerns,this paper presents the mathematical and computer modeling of a novel two-dimensional(2D)chaotic system for secure key generation in quantum image encryption(QIE).The proposed map employs trigonometric perturbations in conjunction with rational-saturation functions and hence,named as Trigonometric-Rational-Saturation(TRS)map.Through rigorous mathematical analysis and computational simulations,the map is extensively evaluated for bifurcation behaviour,chaotic trajectories,and Lyapunov exponents.The security evaluation validates the map’s non-linearity,unpredictability,and sensitive dependence on initial conditions.In addition,the proposed TRS map has further been tested by integrating it in a QIE scheme.The QIE scheme first quantum-encodes the classic image using the Novel Enhanced Quantum Representation(NEQR)technique,the TRS map is used for the generation of secure diffusion key,which is XOR-ed with the quantum-ready image to obtain the encrypted images.The security evaluation of the QIE scheme demonstrates superior security of the encrypted images in terms of statistical security attacks and also against Differential attacks.The encrypted images exhibit zero correlation and maximum entropy with demonstrating strong resilience due to 99.62%and 33.47%results for Number of Pixels Change Rate(NPCR)and Unified Average Changing Intensity(UACI).The results validate the effectiveness of TRS-based quantum encryption scheme in securing digital images against emerging quantum threats,making it suitable for secure image encryption in IoT and edge-based applications.
基金supported by Ajman University Internal Research Grant No.(DRGS Ref.2024-IRGHBS-3).
文摘Fractional discrete systems can enable the modeling and control of the complicated processes more adaptable through the concept of versatility by providing systemdynamics’descriptions withmore degrees of freedom.Numerical approaches have become necessary and sufficient to be addressed and employed for benefiting from the adaptability of such systems for varied applications.A variety of fractional Layla and Majnun model(LMM)system kinds has been proposed in the current work where some of these systems’key behaviors are addressed.In addition,the necessary and sufficient conditions for the stability and asymptotic stability of the fractional dynamic systems are investigated,as a result of which,the necessary requirements of the LMM to achieve constant and asymptotically steady zero resolutions are provided.As a special case,when Layla and Majnun have equal feelings,we propose an analysis of the system in view of its equilibrium and fixed point sets.Considering that the system has marginal stability if its eigenvalues have both negative and zero real portions,it is demonstrated that the system neither converges nor diverges to a steady trajectory or equilibrium point.It,rather,continues to hover along the line separating stability and instability based on the fractional LMM system.
文摘This research study aims to enhance the optimization performance of a newly emerged Aquila Optimization algorithm by incorporating chaotic sequences rather than using uniformly generated Gaussian random numbers.This work employs 25 different chaotic maps under the framework of Aquila Optimizer.It considers the ten best chaotic variants for performance evaluation on multidimensional test functions composed of unimodal and multimodal problems,which have yet to be studied in past literature works.It was found that Ikeda chaotic map enhanced Aquila Optimization algorithm yields the best predictions and becomes the leading method in most of the cases.To test the effectivity of this chaotic variant on real-world optimization problems,it is employed on two constrained engineering design problems,and its effectiveness has been verified.Finally,phase equilibrium and semi-empirical parameter estimation problems have been solved by the proposed method,and respective solutions have been compared with those obtained from state-of-art optimizers.It is observed that CH01 can successfully cope with the restrictive nonlinearities and nonconvexities of parameter estimation and phase equilibrium problems,showing the capabilities of yielding minimum prediction error values of no more than 0.05 compared to the remaining algorithms utilized in the performance benchmarking process.
文摘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.
文摘Farmland Fertility Algorithm(FFA)is a recent nature-inspired metaheuristic algorithm for solving optimization problems.Nevertheless,FFA has some drawbacks:slow convergence and imbalance of diversification(exploration)and intensification(exploitation).An adaptive mechanism in every algorithm can achieve a proper balance between exploration and exploitation.The literature shows that chaotic maps are incorporated into metaheuristic algorithms to eliminate these drawbacks.Therefore,in this paper,twelve chaotic maps have been embedded into FFA to find the best numbers of prospectors to increase the exploitation of the best promising solutions.Furthermore,the Quasi-Oppositional-Based Learning(QOBL)mechanism enhances the exploration speed and convergence rate;we name a CQFFA algorithm.The improvements have been made in line with the weaknesses of the FFA algorithm because the FFA algorithm has fallen into the optimal local trap in solving some complex problems or does not have sufficient ability in the intensification component.The results obtained show that the proposed CQFFA model has been significantly improved.It is applied to twenty-three widely-used test functions and compared with similar state-of-the-art algorithms statistically and visually.Also,the CQFFA algorithm has evaluated six real-world engineering problems.The experimental results showed that the CQFFA algorithm outperforms other competitor algorithms.
基金supported by the National Natural Science Foundation of China (Grant Nos. 61001099 and 10971120)the Foundation for the Author of National Excellent Doctoral Dissertation of China (Grant No. 200444)
文摘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.
基金supported by the Key Research Project of Hainan Province[ZDYF2018129]the Higher Education Research Project of Hainan Province(Hnky2019-73)+3 种基金the National Natural Science Foundation of China[61762033]the Natural Science Foundation of Hainan[617175]the Special Scientific Research Project of Philosophy and Social Sciences of Chongqing Medical University[201703]the Key Research Project of Haikou College of Economics[HJKZ18-01].
文摘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.
基金Supported by the National Natural Science Foundation of China (60973162)the Natural Science Foundation of Shandong Province of China (ZR2009GM037)+2 种基金the Science and Technology Project of Shandong Province,China (2010GGX10132,2012GGX10110)the Key Natural Science Foundation of Shan-dong Province of China (Z2006G01)the Soft Science Project of Shangdong Province of China (2012RKA10009)
文摘Chaotic cryptography has been applied to image encryption;however,only the traditional low-dimensional chaotic systems has been widely analyzed or deciphered,which does not show satisfied security and efficiency.To solve this problem,a new algorithm based on cross-chaos map has been created in this article.The image pixels are scrambled under control of high-dimensional chaotic sequence,which is generated by cross chaotic map.The image pixels are substituted by ciphertext feedback algorithm.It can relate encryption required parameters with plaintext and can make a plaintext byte affect more ciphertext bytes.Proved by theoretical analysis and experimental results,the algorithm has higher complex degree and has passed SP800-22 pseudo-random number standard tests,and it has high encryption speed,high security,etc.It can be widely applied in the field of image encryption.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61173183, 60973152, and 60573172)the Doctoral Program Foundation of Institution of Higher Education of China (Grant No. 20070141014)+2 种基金the Program for Excellent Talents in Universities of Liaoning Province, China (Grant No. LR2012003)the Natural Science Foundation of Liaoning Province, China (Grant No. 20082165)the Fundamental Research Funds for the Central Universities of China (Grant No. DUT12JB06)
文摘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.
文摘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.
