The advent of 5G technology has significantly enhanced the transmission of images over networks,expanding data accessibility and exposure across various applications in digital technology and social media.Consequently...The advent of 5G technology has significantly enhanced the transmission of images over networks,expanding data accessibility and exposure across various applications in digital technology and social media.Consequently,the protection of sensitive data has become increasingly critical.Regardless of the complexity of the encryption algorithm used,a robust and highly secure encryption key is essential,with randomness and key space being crucial factors.This paper proposes a new Robust Deoxyribonucleic Acid(RDNA)nucleotide-based encryption method.The RDNA encryption method leverages the unique properties of DNA nucleotides,including their inherent randomness and extensive key space,to generate a highly secure encryption key.By employing transposition and substitution operations,the RDNA method ensures significant diffusion and confusion in the encrypted images.Additionally,it utilises a pseudorandom generation technique based on the random sequence of nucleotides in the DNA secret key.The performance of the RDNA encryption method is evaluated through various statistical and visual tests,and compared against established encryption methods such as 3DES,AES,and a DNA-based method.Experimental results demonstrate that the RDNA encryption method outperforms its rivals in the literature,and achieves superior performance in terms of information entropy,avalanche effect,encryption execution time,and correlation reduction,while maintaining competitive values for NMAE,PSNR,NPCR,and UACI.The high degree of randomness and sensitivity to key changes inherent in the RDNA method offers enhanced security,making it highly resistant to brute force and differential attacks.展开更多
Optical cryptanalysis is essential to the further investigation of more secure optical cryptosystems.Learning-based at-tack of optical encryption eliminates the need for the retrieval of random phase keys of optical e...Optical cryptanalysis is essential to the further investigation of more secure optical cryptosystems.Learning-based at-tack of optical encryption eliminates the need for the retrieval of random phase keys of optical encryption systems but it is limited for practical applications since it requires a large set of plaintext-ciphertext pairs for the cryptosystem to be at-tacked.Here,we propose a two-step deep learning strategy for ciphertext-only attack(COA)on the classical double ran-dom phase encryption(DRPE).Specifically,we construct a virtual DRPE system to gather the training data.Besides,we divide the inverse problem in COA into two more specific inverse problems and employ two deep neural networks(DNNs)to respectively learn the removal of speckle noise in the autocorrelation domain and the de-correlation operation to retrieve the plaintext image.With these two trained DNNs at hand,we show that the plaintext can be predicted in real-time from an unknown ciphertext alone.The proposed learning-based COA method dispenses with not only the retrieval of random phase keys but also the invasive data acquisition of plaintext-ciphertext pairs in the DPRE system.Numerical simulations and optical experiments demonstrate the feasibility and effectiveness of the proposed learning-based COA method.展开更多
The principle of ptychography is applied in known plain text attack on the double random phase encoding （DRPE） system. We find that with several pairs of plain texts and cipher texts, the model of attack on DRPE can...The principle of ptychography is applied in known plain text attack on the double random phase encoding （DRPE） system. We find that with several pairs of plain texts and cipher texts, the model of attack on DRPE can be converted to the model of ptyehographical imaging. Owing to the inherent merits of the ptyehographical imaging, the DRPE system can be breached totally in a fast and nearly perfect way, which is unavailable for currently existing attack methods. Further, since the decryption keys can be seen as an object to be imaged from the perspective of imaging, the ptychographical technique may be a kind of new direction to further analysis of the security of other encryption systems based on double random keys.展开更多
Compressing encrypted images remains a challenge.As illustrated in our previous work on compression of encrypted binary images,it is preferable to exploit statistical characteristics at the receiver.Through this line,...Compressing encrypted images remains a challenge.As illustrated in our previous work on compression of encrypted binary images,it is preferable to exploit statistical characteristics at the receiver.Through this line,we characterize statistical correlations between adjacent bitplanes of a gray image with the Markov random field(MRF),represent it with a factor graph,and integrate the constructed MRF factor graph in that for binary image reconstruction,which gives rise to a joint factor graph for gray images reconstruction(JFGIR).By exploiting the JFGIR at the receiver to facilitate the reconstruction of the original bitplanes and deriving theoretically the sum-product algorithm(SPA)adapted to the JFGIR,a novel MRF-based encryption-then-compression(ETC)scheme is thus proposed.After preferable universal parameters of the MRF between adjacent bitplanes are sought via a numerical manner,extensive experimental simulations are then carried out to show that the proposed scheme successfully compresses the first 3 and 4 most significant bitplanes(MSBs)for most test gray images and the others with a large portion of smooth area,respectively.Thus,the proposed scheme achieves significant improvement against the state-of-the-art leveraging the 2-D Markov source model at the receiver and is comparable or somewhat inferior to that using the resolution-progressive strategy in recovery.展开更多
A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction fr...A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security.展开更多
Searchable public key encryption is a useful cryptographic paradigm that enables an untrustworthy server to retrieve the encrypted data without revealing the contents of the data. It offers a promising solution to enc...Searchable public key encryption is a useful cryptographic paradigm that enables an untrustworthy server to retrieve the encrypted data without revealing the contents of the data. It offers a promising solution to encrypted data retrieval in cryptographic cloud storage. Certificateless public key cryptography (CLPKC) is a novel cryptographic primitive that has many merits. It overcomes the key escrow problem in identity-based cryptography (IBC) and the cumbersome certificate problem in conventional public key cryptography (PKC). Motivated by the appealing features of CLPKC, several certificateless encryption with keyword search (CLEKS) schemes have been presented in the literature. But, our cryptanalysis demonstrates that the previously proposed CLEKS frameworks suffer from the security vulnerability caused by the keyword guessing attack. To remedy the security weakness in the previous frameworks and provide resistance against both inside and outside keyword guessing attacks, we propose a new CLEKS framework. Under the new framework, we design a concrete CLEKS scheme and formally prove its security in the random oracle model. Compared with previous two CLEKS schemes, the proposed scheme has better overall performance while offering stronger security guarantee as it withstands the existing known types of keyword guessing attacks.展开更多
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...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).展开更多
In this paper, the quality of image encryption using filter bank with lifting scheme has been studied and evaluated. Many extensive techniques have been applied to examine the security of the image encryption using th...In this paper, the quality of image encryption using filter bank with lifting scheme has been studied and evaluated. Many extensive techniques have been applied to examine the security of the image encryption using the filter bank cipher with one or two rounds. To analyze and evaluate the proposed scheme, many parameters have been employed, such as, histogram analysis, correlation coefficient, global entropy, block entropy, avalanche effect, number of pixel change rate (NPCR), unified average change intensity (UACI), compression friendliness, exhaustive key analysis, and key sensitivity test. The simulation results showed that, the quality of the image encryption passes all these tests. Moreover, it reaches or excels the current state-of-the-arts. So that, the proposed image encryption process produces random-like output from the statistical point of views.展开更多
In current cloud computing system, large amounts of sensitive data are shared to other cloud users. To keep these data confidentiality, data owners should encrypt their data before outsourcing. We choose proxy reencry...In current cloud computing system, large amounts of sensitive data are shared to other cloud users. To keep these data confidentiality, data owners should encrypt their data before outsourcing. We choose proxy reencryption （PRE） as the cloud data encryption technique. In a PRE system, a semi-trusted proxy can transform a ciphertext under one public key into a ciphertext of the same message under another public key, but the proxy cannot gain any information about the message. In this paper, we propose a certificateless PRE （CL-PRE） scheme without pairings. The security of the proposed scheme can be proved to be equivalent to the computational Dire- Hellman （CDH） problem in the random oracle model. Compared with other existing CL-PRE schemes, our scheme requires less computation cost and is significantly more efficient. The new scheme does not need the public key certificates to guarantee validity of public keys and solves the key escrow problem in identity-based public key cryptography.展开更多
In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. Th...In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. The scheme is non-interactive, unidirectional and collude ＂safe＂. Furthermore, it is compatible with current IBE （identity-based encryption） deployments. The scheme has chosen ciphertext security in the random oracle model assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.展开更多
Internet of Things is an ecosystem of interconnected devices that are accessible through the internet.The recent research focuses on adding more smartness and intelligence to these edge devices.This makes them suscept...Internet of Things is an ecosystem of interconnected devices that are accessible through the internet.The recent research focuses on adding more smartness and intelligence to these edge devices.This makes them susceptible to various kinds of security threats.These edge devices rely on cryptographic techniques to encrypt the pre-processed data collected from the sensors deployed in the field.In this regard,block cipher has been one of the most reliable options through which data security is accomplished.The strength of block encryption algorithms against different attacks is dependent on its nonlinear primitive which is called Substitution Boxes.For the design of S-boxes mainly algebraic and chaos-based techniques are used but researchers also found various weaknesses in these techniques.On the other side,literature endorse the true random numbers for information security due to the reason that,true random numbers are purely non-deterministic.In this paper firstly a natural dynamical phenomenon is utilized for the generation of true random numbers based S-boxes.Secondly,a systematic literature review was conducted to know which metaheuristic optimization technique is highly adopted in the current decade for the optimization of S-boxes.Based on the outcome of Systematic Literature Review(SLR),genetic algorithm is chosen for the optimization of s-boxes.The results of our method validate that the proposed dynamic S-boxes are effective for the block ciphers.Moreover,our results showed that the proposed substitution boxes achieve better cryptographic strength as compared with state-of-the-art techniques.展开更多
This paper focuses on the instantiation of random oracles in public key encryption schemes. A misunderstanding in the former instantiations is pointed out and analyzed. A method of using this primitive as a substituti...This paper focuses on the instantiation of random oracles in public key encryption schemes. A misunderstanding in the former instantiations is pointed out and analyzed. A method of using this primitive as a substitution of random oracles is also proposed. The partial and full instantiations of random oracles in optimal asymmetric encryption padding （OAEP） implemented by pseudorandom functions are described and the resulted schemes are proven to be indistinguishable secure against adaptive chosen ciphertext attack （IND-CCA2） secure. Using this method, one can transform a practical public key encryption scheme secure in the random oracle model into a standard-model secure scheme. The security of the scheme is based on computational assumptions, which is weaker than decisional assumptions used in Cramer- Shoup like schemes.展开更多
Security of images plays an import role in communication in current era due to the popularity and high usage ofmultimedia content in the Internet.Image security is described as applying an encryption algorithm over th...Security of images plays an import role in communication in current era due to the popularity and high usage ofmultimedia content in the Internet.Image security is described as applying an encryption algorithm over the given plaintext images to produce cipher images that can be transmitted safely over the open channel,the Internet.The problem which plagues these image ciphers is that they are too much time consuming,and that do not meet the dictates of the present times.In this paper,we aim to provide an efficient image cipher.The previous studies employed many constructs like Langton’s Ant,15 puzzle game and Castle in the 2D scrambled image based image ciphers,which had grave implications related to the high execution time of the ciphers.The current study directly made use of the 2D scrambled image to realize the purpose.Moreover,no compromise has been made over the security of the proposed image cipher.Random numbers have been generated by triggering the Intertwining Logistic Chaotic map.The cipher has been subjected to many important validation metrics like key space,information entropy,correlation coefficient,crop attack and lastly time complexity to demonstrate its immunity to the various attacks,and its realworld application.In this paper,our proposed image cipher exhibits an encryption speed of 0.1797 s,which is far better than many of the existing encryption ciphers.展开更多
文摘The advent of 5G technology has significantly enhanced the transmission of images over networks,expanding data accessibility and exposure across various applications in digital technology and social media.Consequently,the protection of sensitive data has become increasingly critical.Regardless of the complexity of the encryption algorithm used,a robust and highly secure encryption key is essential,with randomness and key space being crucial factors.This paper proposes a new Robust Deoxyribonucleic Acid(RDNA)nucleotide-based encryption method.The RDNA encryption method leverages the unique properties of DNA nucleotides,including their inherent randomness and extensive key space,to generate a highly secure encryption key.By employing transposition and substitution operations,the RDNA method ensures significant diffusion and confusion in the encrypted images.Additionally,it utilises a pseudorandom generation technique based on the random sequence of nucleotides in the DNA secret key.The performance of the RDNA encryption method is evaluated through various statistical and visual tests,and compared against established encryption methods such as 3DES,AES,and a DNA-based method.Experimental results demonstrate that the RDNA encryption method outperforms its rivals in the literature,and achieves superior performance in terms of information entropy,avalanche effect,encryption execution time,and correlation reduction,while maintaining competitive values for NMAE,PSNR,NPCR,and UACI.The high degree of randomness and sensitivity to key changes inherent in the RDNA method offers enhanced security,making it highly resistant to brute force and differential attacks.
基金financial supports from the National Natural Science Foundation of China(NSFC)(62061136005,61705141,61805152,61875129,61701321)Sino-German Research Collaboration Group(GZ 1391)+2 种基金the Mobility program(M-0044)sponsored by the Sino-German CenterChinese Academy of Sciences(QYZDB-SSW-JSC002)Science and Technology Innovation Commission of Shenzhen(JCYJ20170817095047279)。
文摘Optical cryptanalysis is essential to the further investigation of more secure optical cryptosystems.Learning-based at-tack of optical encryption eliminates the need for the retrieval of random phase keys of optical encryption systems but it is limited for practical applications since it requires a large set of plaintext-ciphertext pairs for the cryptosystem to be at-tacked.Here,we propose a two-step deep learning strategy for ciphertext-only attack(COA)on the classical double ran-dom phase encryption(DRPE).Specifically,we construct a virtual DRPE system to gather the training data.Besides,we divide the inverse problem in COA into two more specific inverse problems and employ two deep neural networks(DNNs)to respectively learn the removal of speckle noise in the autocorrelation domain and the de-correlation operation to retrieve the plaintext image.With these two trained DNNs at hand,we show that the plaintext can be predicted in real-time from an unknown ciphertext alone.The proposed learning-based COA method dispenses with not only the retrieval of random phase keys but also the invasive data acquisition of plaintext-ciphertext pairs in the DPRE system.Numerical simulations and optical experiments demonstrate the feasibility and effectiveness of the proposed learning-based COA method.
基金Supported by the National Natural Science Foundation of China under Grant Nos 61575197 and 61307018the K.C.Wong Education Foundation,the President Fund of University of Chinese Academy of Sciencesthe Fusion Funds of Research and Education of Chinese Academy of Sciences
文摘The principle of ptychography is applied in known plain text attack on the double random phase encoding （DRPE） system. We find that with several pairs of plain texts and cipher texts, the model of attack on DRPE can be converted to the model of ptyehographical imaging. Owing to the inherent merits of the ptyehographical imaging, the DRPE system can be breached totally in a fast and nearly perfect way, which is unavailable for currently existing attack methods. Further, since the decryption keys can be seen as an object to be imaged from the perspective of imaging, the ptychographical technique may be a kind of new direction to further analysis of the security of other encryption systems based on double random keys.
基金This work is supported in part by the National Natural Science Foundation of China under contracts 61672242 and 61702199in part by China Spark Program under Grant 2015GA780002+1 种基金in part by The National Key Research and Development Program of China under Grant 2017YFD0701601in part by Natural Science Foundation of Guangdong Province under Grant 2015A030313413.
文摘Compressing encrypted images remains a challenge.As illustrated in our previous work on compression of encrypted binary images,it is preferable to exploit statistical characteristics at the receiver.Through this line,we characterize statistical correlations between adjacent bitplanes of a gray image with the Markov random field(MRF),represent it with a factor graph,and integrate the constructed MRF factor graph in that for binary image reconstruction,which gives rise to a joint factor graph for gray images reconstruction(JFGIR).By exploiting the JFGIR at the receiver to facilitate the reconstruction of the original bitplanes and deriving theoretically the sum-product algorithm(SPA)adapted to the JFGIR,a novel MRF-based encryption-then-compression(ETC)scheme is thus proposed.After preferable universal parameters of the MRF between adjacent bitplanes are sought via a numerical manner,extensive experimental simulations are then carried out to show that the proposed scheme successfully compresses the first 3 and 4 most significant bitplanes(MSBs)for most test gray images and the others with a large portion of smooth area,respectively.Thus,the proposed scheme achieves significant improvement against the state-of-the-art leveraging the 2-D Markov source model at the receiver and is comparable or somewhat inferior to that using the resolution-progressive strategy in recovery.
文摘A novel image encryption method based on the random sequence generated from the generalized information domain and permutation–diffusion architecture is proposed. The random sequence is generated by reconstruction from the generalized information file and discrete trajectory extraction from the data stream. The trajectory address sequence is used to generate a P-box to shuffle the plain image while random sequences are treated as keystreams. A new factor called drift factor is employed to accelerate and enhance the performance of the random sequence generator. An initial value is introduced to make the encryption method an approximately one-time pad. Experimental results show that the random sequences pass the NIST statistical test with a high ratio and extensive analysis demonstrates that the new encryption scheme has superior security.
基金supported by the National Natural Science Foundation of China under Grant Nos. 61772009 and U1736112the Natural Science Foundation of Jiangsu Province under Grant Nos. BK20161511 and BK20181304
文摘Searchable public key encryption is a useful cryptographic paradigm that enables an untrustworthy server to retrieve the encrypted data without revealing the contents of the data. It offers a promising solution to encrypted data retrieval in cryptographic cloud storage. Certificateless public key cryptography (CLPKC) is a novel cryptographic primitive that has many merits. It overcomes the key escrow problem in identity-based cryptography (IBC) and the cumbersome certificate problem in conventional public key cryptography (PKC). Motivated by the appealing features of CLPKC, several certificateless encryption with keyword search (CLEKS) schemes have been presented in the literature. But, our cryptanalysis demonstrates that the previously proposed CLEKS frameworks suffer from the security vulnerability caused by the keyword guessing attack. To remedy the security weakness in the previous frameworks and provide resistance against both inside and outside keyword guessing attacks, we propose a new CLEKS framework. Under the new framework, we design a concrete CLEKS scheme and formally prove its security in the random oracle model. Compared with previous two CLEKS schemes, the proposed scheme has better overall performance while offering stronger security guarantee as it withstands the existing known types of keyword guessing attacks.
基金This research work was partially funded by the Chiang Mai University.
文摘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).
文摘In this paper, the quality of image encryption using filter bank with lifting scheme has been studied and evaluated. Many extensive techniques have been applied to examine the security of the image encryption using the filter bank cipher with one or two rounds. To analyze and evaluate the proposed scheme, many parameters have been employed, such as, histogram analysis, correlation coefficient, global entropy, block entropy, avalanche effect, number of pixel change rate (NPCR), unified average change intensity (UACI), compression friendliness, exhaustive key analysis, and key sensitivity test. The simulation results showed that, the quality of the image encryption passes all these tests. Moreover, it reaches or excels the current state-of-the-arts. So that, the proposed image encryption process produces random-like output from the statistical point of views.
基金the National Natural Science Foundation of China(No.61133014)
文摘In current cloud computing system, large amounts of sensitive data are shared to other cloud users. To keep these data confidentiality, data owners should encrypt their data before outsourcing. We choose proxy reencryption （PRE） as the cloud data encryption technique. In a PRE system, a semi-trusted proxy can transform a ciphertext under one public key into a ciphertext of the same message under another public key, but the proxy cannot gain any information about the message. In this paper, we propose a certificateless PRE （CL-PRE） scheme without pairings. The security of the proposed scheme can be proved to be equivalent to the computational Dire- Hellman （CDH） problem in the random oracle model. Compared with other existing CL-PRE schemes, our scheme requires less computation cost and is significantly more efficient. The new scheme does not need the public key certificates to guarantee validity of public keys and solves the key escrow problem in identity-based public key cryptography.
基金Supported by the National Natural Science Foundation of China (60673070)the Natural Science Foundation of Jiangsu Province, China (BK2006217)
文摘In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. The scheme is non-interactive, unidirectional and collude ＂safe＂. Furthermore, it is compatible with current IBE （identity-based encryption） deployments. The scheme has chosen ciphertext security in the random oracle model assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.
文摘Internet of Things is an ecosystem of interconnected devices that are accessible through the internet.The recent research focuses on adding more smartness and intelligence to these edge devices.This makes them susceptible to various kinds of security threats.These edge devices rely on cryptographic techniques to encrypt the pre-processed data collected from the sensors deployed in the field.In this regard,block cipher has been one of the most reliable options through which data security is accomplished.The strength of block encryption algorithms against different attacks is dependent on its nonlinear primitive which is called Substitution Boxes.For the design of S-boxes mainly algebraic and chaos-based techniques are used but researchers also found various weaknesses in these techniques.On the other side,literature endorse the true random numbers for information security due to the reason that,true random numbers are purely non-deterministic.In this paper firstly a natural dynamical phenomenon is utilized for the generation of true random numbers based S-boxes.Secondly,a systematic literature review was conducted to know which metaheuristic optimization technique is highly adopted in the current decade for the optimization of S-boxes.Based on the outcome of Systematic Literature Review(SLR),genetic algorithm is chosen for the optimization of s-boxes.The results of our method validate that the proposed dynamic S-boxes are effective for the block ciphers.Moreover,our results showed that the proposed substitution boxes achieve better cryptographic strength as compared with state-of-the-art techniques.
基金Supported by the National Basic Research Program of China (973 Program) (2007CB311201)the National High-Technology Research and Development Program of China (863 Program) (2006AA01Z427)the National Natural Science Foundation of China (60673073)
文摘This paper focuses on the instantiation of random oracles in public key encryption schemes. A misunderstanding in the former instantiations is pointed out and analyzed. A method of using this primitive as a substitution of random oracles is also proposed. The partial and full instantiations of random oracles in optimal asymmetric encryption padding （OAEP） implemented by pseudorandom functions are described and the resulted schemes are proven to be indistinguishable secure against adaptive chosen ciphertext attack （IND-CCA2） secure. Using this method, one can transform a practical public key encryption scheme secure in the random oracle model into a standard-model secure scheme. The security of the scheme is based on computational assumptions, which is weaker than decisional assumptions used in Cramer- Shoup like schemes.
文摘Security of images plays an import role in communication in current era due to the popularity and high usage ofmultimedia content in the Internet.Image security is described as applying an encryption algorithm over the given plaintext images to produce cipher images that can be transmitted safely over the open channel,the Internet.The problem which plagues these image ciphers is that they are too much time consuming,and that do not meet the dictates of the present times.In this paper,we aim to provide an efficient image cipher.The previous studies employed many constructs like Langton’s Ant,15 puzzle game and Castle in the 2D scrambled image based image ciphers,which had grave implications related to the high execution time of the ciphers.The current study directly made use of the 2D scrambled image to realize the purpose.Moreover,no compromise has been made over the security of the proposed image cipher.Random numbers have been generated by triggering the Intertwining Logistic Chaotic map.The cipher has been subjected to many important validation metrics like key space,information entropy,correlation coefficient,crop attack and lastly time complexity to demonstrate its immunity to the various attacks,and its realworld application.In this paper,our proposed image cipher exhibits an encryption speed of 0.1797 s,which is far better than many of the existing encryption ciphers.
