In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. This paper proposes a new approach for image encryption based on a hi...In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. This paper proposes a new approach for image encryption based on a high-dimensional chaotic map. The new scheme employs the Cat map to shuffle the positions, then to confuse the relationship between the cipher-image and the plain-image using the high-dimensional Lorenz chaotic map preprocessed. The results of experimental, statistical analysis and key space analysis show that the proposed image encryption scheme provides an efficient and secure way for real-time image encryption and transmission.展开更多
In this paper, a compressive sensing (CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firs...In this paper, a compressive sensing (CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firstly. Then the watermark is adhered to the scrambled data. By compressive sensing, a set of watermarked measurements is obtained as the watermarked cipher image. In this algorithm, watermark embedding and data compression can be performed without knowing the original image; similarly, watermark extraction will not interfere with decryption. Due to the characteristics of CS, this algorithm features compressible cipher image size, flexible watermark capacity, and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss. Simulation results and analyses show that the algorithm achieves good performance in the sense of security, watermark capacity, extraction accuracy, reconstruction, robustness, etc.展开更多
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.展开更多
We propose a new asymmetric pixel confusion algorithm for images based on the Rivest-Shamir-Adleman(RSA)public-key cryptosystem and Arnold map.First,the RSA asymmetric algorithm is used to generate two groups of Arnol...We propose a new asymmetric pixel confusion algorithm for images based on the Rivest-Shamir-Adleman(RSA)public-key cryptosystem and Arnold map.First,the RSA asymmetric algorithm is used to generate two groups of Arnold transform parameters to address the problem of symmetrical distribution of Arnold map parameters.Second,the image is divided into blocks,and the first group of parameters is used to perform Arnold confusion on each sub-block.Then,the second group of parameters is used to perform Arnold confusion on the entire image.The image correlation is thereby fully weakened,and the image confusion degree and effect are further enhanced.The experimental results show that the proposed image pixel confusion algorithm has better confusion effect than the classical Arnold map based confusion and the row-column exchange based confusion.Specifically,the values of gray difference are close to one.In addition,the security of the new confusion operation is dependent on RSA,and it can act as one part of a confusion-substitution structure in a cipher.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant No 60472112) and the Foundation for the author of National Excellent Doctoral Dissertation of China (Grant No 200444).
文摘In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. This paper proposes a new approach for image encryption based on a high-dimensional chaotic map. The new scheme employs the Cat map to shuffle the positions, then to confuse the relationship between the cipher-image and the plain-image using the high-dimensional Lorenz chaotic map preprocessed. The results of experimental, statistical analysis and key space analysis show that the proposed image encryption scheme provides an efficient and secure way for real-time image encryption and transmission.
基金Project supported by the Open Research Fund of Chongqing Key Laboratory of Emergency Communications,China(Grant No.CQKLEC,20140504)the National Natural Science Foundation of China(Grant Nos.61173178,61302161,and 61472464)the Fundamental Research Funds for the Central Universities,China(Grant Nos.106112013CDJZR180005 and 106112014CDJZR185501)
文摘In this paper, a compressive sensing (CS) and chaotic map-based joint image encryption and watermarking algorithm is proposed. The transform domain coefficients of the original image are scrambled by Arnold map firstly. Then the watermark is adhered to the scrambled data. By compressive sensing, a set of watermarked measurements is obtained as the watermarked cipher image. In this algorithm, watermark embedding and data compression can be performed without knowing the original image; similarly, watermark extraction will not interfere with decryption. Due to the characteristics of CS, this algorithm features compressible cipher image size, flexible watermark capacity, and lossless watermark extraction from the compressed cipher image as well as robustness against packet loss. Simulation results and analyses show that the algorithm achieves good performance in the sense of security, watermark capacity, extraction accuracy, reconstruction, robustness, etc.
文摘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.
基金Project supported by the National Natural Science Foundation of China(Nos.61972103 and 61702116)the Natural Science Foundation of Guangdong Province,China(No.2019A1515011361)+1 种基金the Project of Enhancing School with Innovation of Guangdong Ocean University(No.Q18306)the Guangdong Postgraduate Education Innovation Project(No.2020JGXM059)。
文摘We propose a new asymmetric pixel confusion algorithm for images based on the Rivest-Shamir-Adleman(RSA)public-key cryptosystem and Arnold map.First,the RSA asymmetric algorithm is used to generate two groups of Arnold transform parameters to address the problem of symmetrical distribution of Arnold map parameters.Second,the image is divided into blocks,and the first group of parameters is used to perform Arnold confusion on each sub-block.Then,the second group of parameters is used to perform Arnold confusion on the entire image.The image correlation is thereby fully weakened,and the image confusion degree and effect are further enhanced.The experimental results show that the proposed image pixel confusion algorithm has better confusion effect than the classical Arnold map based confusion and the row-column exchange based confusion.Specifically,the values of gray difference are close to one.In addition,the security of the new confusion operation is dependent on RSA,and it can act as one part of a confusion-substitution structure in a cipher.