To ensure the security of a digital image, a new self-adapting encryption algorithm based on the spatiotemporal chaos and ergodic matrix is proposed in this paper. First, the plain-image is divided into different bloc...To ensure the security of a digital image, a new self-adapting encryption algorithm based on the spatiotemporal chaos and ergodic matrix is proposed in this paper. First, the plain-image is divided into different blocks of the same size, and each block is sorted in ascending order to obtain the corresponding standard ergodic matrix. Then each block is encrypted by the spatiotemporal chaotic system and shuffled according to the standard ergodic matrix. Finally, all modules are rearranged to acquire the final encrypted image. In particular, the plain-image information is used in the initial conditions of the spatiotemporal chaos and the ergodic matrices, so different plain-images will be encrypted to obtain different cipherimages. Theoretical analysis and simulation results indicate that the performance and security of the proposed encryption scheme can encrypt the image effectively and resist various typical attacks.展开更多
In this paper,we provide a new approach to data encryption using generalized inverses.Encryption is based on the implementation of weighted Moore–Penrose inverse A y MNenxmT over the nx8 constant matrix.The square He...In this paper,we provide a new approach to data encryption using generalized inverses.Encryption is based on the implementation of weighted Moore–Penrose inverse A y MNenxmT over the nx8 constant matrix.The square Hermitian positive definite matrix N8x8 p is the key.The proposed solution represents a very strong key since the number of different variants of positive definite matrices of order 8 is huge.We have provided NIST(National Institute of Standards and Technology)quality assurance tests for a random generated Hermitian matrix(a total of 10 different tests and additional analysis with approximate entropy and random digression).In the additional testing of the quality of the random matrix generated,we can conclude that the results of our analysis satisfy the defined strict requirements.This proposed MP encryption method can be applied effectively in the encryption and decryption of images in multi-party communications.In the experimental part of this paper,we give a comparison of encryption methods between machine learning methods.Machine learning algorithms could be compared by achieved results of classification concentrating on classes.In a comparative analysis,we give results of classifying of advanced encryption standard(AES)algorithm and proposed encryption method based on Moore–Penrose inverse.展开更多
Many symmetric and asymmetric encryption algorithms have been developed in cloud computing to transmit data in a secure form.Cloud cryptography is a data encryption mechanism that consists of different steps and preve...Many symmetric and asymmetric encryption algorithms have been developed in cloud computing to transmit data in a secure form.Cloud cryptography is a data encryption mechanism that consists of different steps and prevents the attacker from misusing the data.This paper has developed an efficient algorithm to protect the data from invaders and secure the data from misuse.If this algorithm is applied to the cloud network,the attacker will not be able to access the data.To encrypt the data,the values of the bytes have been obtained by converting the plain text to ASCII.A key has been generated using the Non-Deterministic Bit Generator(NRBG)mechanism,and the key is XNORed with plain text bits,and then Bit toggling has been implemented.After that,an efficient matrix cipher encryption algorithm has been developed,and this algorithm has been applied to this text.The capability of this algorithm is that with its help,a key has been obtained from the plain text,and only by using this key can the data be decrypted in the first steps.A plain text key will never be used for another plain text.The data has been secured by implementing different mechanisms in both stages,and after that,a ciphertext has been obtained.At the end of the article,the latest technique will be compared with different techniques.There will be a discussion on how the present technique is better than all the other techniques;then,the conclusion will be drawn based on comparative analysis.展开更多
The paper proposes a novel algorithm to get the encryption matrix. Firstly, a chaotic sequence generated by Chebyshev chaotic neural networks is converted into a series of low-order integer matrices from which availab...The paper proposes a novel algorithm to get the encryption matrix. Firstly, a chaotic sequence generated by Chebyshev chaotic neural networks is converted into a series of low-order integer matrices from which available encryption matrices are selected. Then, a higher order encryption matrix relating real world application is constructed by means of tensor production method based on selected encryption matrices. The results show that the proposed algorithm can produce a "one-time pad cipher" encryption matrix with high security; and the encryption results have good chaos and auto-correlation with the natural frequency of the plaintext being hidden and homogenized.展开更多
Any linear transform matrix can be used to easily calculate a consistent form, and a plurality of conversion can be easily connected together by matrix multiplication. When performing file transfers, you can encrypt f...Any linear transform matrix can be used to easily calculate a consistent form, and a plurality of conversion can be easily connected together by matrix multiplication. When performing file transfers, you can encrypt files matrix transformation. Article presents a matrix-based electronic document encryption and decryption algorithm, which relies on a special class of matrices combinatorial problems, the method to improve the security of electronic document system is feasible and effective, and finally give the source code and programming software.展开更多
In this paper, first, we investigate a novel one-dimensional logistic-PWLCM(LP) modulation map which is derived from the logistic and PWLCM maps. Second, we propose a novel PCLML spatiotemporal chaos in pseudo-rando...In this paper, first, we investigate a novel one-dimensional logistic-PWLCM(LP) modulation map which is derived from the logistic and PWLCM maps. Second, we propose a novel PCLML spatiotemporal chaos in pseudo-random coupling method that can accelerate the system behavior of the fully spatial chaos. Here, because the better chaotic properties include a wide range of parameter settings and better ergodicity than a logistic map, the LP is used in PCLML as f(x). The Kolmogorov–Sinai entropy density and universality and the bifurcation diagram are employed to investigate the chaotic behaviors of the proposed PCLML model. Finally, we apply the LP and PCLML chaotic systems to image encryption to improve the effectiveness and security of the encryption scheme. By combining self-generating matrix model M and dynamic substitution box(S-Box) methods, we design a new image encryption algorithm. Numerical simulations and security analysis have been carried out to demonstrate that the proposed algorithm has a high security level and can efficiently encrypt several different kinds of images into random-like images.展开更多
The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant qua...The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and eneryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security,security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.展开更多
Cloud computing, a recently emerged paradigm faces major challenges in achieving the privacy of migrated data, network security, etc. Too many cryptographic technologies are raised to solve these issues based on ident...Cloud computing, a recently emerged paradigm faces major challenges in achieving the privacy of migrated data, network security, etc. Too many cryptographic technologies are raised to solve these issues based on identity, attributes and prediction algorithms yet;these techniques are highly prone to attackers. This would raise a need of an effective encryption technique, which would ensure secure data migration. With this scenario, our proposed methodology Efficient Probabilistic Public Key Encryption(EPPKE) is optimized with Covariance Matrix Adaptation Evolution Strategies(CMA-ES). It ensures data integrity through the Luhn algorithm with BLAKE 2b encapsulation. This enables an optimized security to the data which is migrated through cloud. The proposed methodology is implemented in Open Stack with Java Language. It achieves better results by providing security compared to other existing techniques like RSA, IBA, ABE, PBE, etc.展开更多
There are many cloud data security techniques and algorithms available that can be used to detect attacks on cloud data,but these techniques and algorithms cannot be used to protect data from an attacker.Cloud cryptog...There are many cloud data security techniques and algorithms available that can be used to detect attacks on cloud data,but these techniques and algorithms cannot be used to protect data from an attacker.Cloud cryptography is the best way to transmit data in a secure and reliable format.Various researchers have developed various mechanisms to transfer data securely,which can convert data from readable to unreadable,but these algorithms are not sufficient to provide complete data security.Each algorithm has some data security issues.If some effective data protection techniques are used,the attacker will not be able to decipher the encrypted data,and even if the attacker tries to tamper with the data,the attacker will not have access to the original data.In this paper,various data security techniques are developed,which can be used to protect the data from attackers completely.First,a customized American Standard Code for Information Interchange(ASCII)table is developed.The value of each Index is defined in a customized ASCII table.When an attacker tries to decrypt the data,the attacker always tries to apply the predefined ASCII table on the Ciphertext,which in a way,can be helpful for the attacker to decrypt the data.After that,a radix 64-bit encryption mechanism is used,with the help of which the number of cipher data is doubled from the original data.When the number of cipher values is double the original data,the attacker tries to decrypt each value.Instead of getting the original data,the attacker gets such data that has no relation to the original data.After that,a Hill Matrix algorithm is created,with the help of which a key is generated that is used in the exact plain text for which it is created,and this Key cannot be used in any other plain text.The boundaries of each Hill text work up to that text.The techniques used in this paper are compared with those used in various papers and discussed that how far the current algorithm is better than all other algorithms.Then,the Kasiski test is used to verify the validity of the proposed algorithm and found that,if the proposed algorithm is used for data encryption,so an attacker cannot break the proposed algorithm security using any technique or algorithm.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.U0735004 and 60972133)the Natural Science Foundation of Guangdong Province,China(Grant No.05006593)+2 种基金the Project Team for Natural Science Foundation of Guangdong Province,China(Grant No.9351064101000003)Energy Technology Key Laboratory Project of Guangdong Province,China(Grant No.2008A060301002)the Fundamental Research Funds for the Central Universities,China(Grant No.X2dXD2116370)
文摘To ensure the security of a digital image, a new self-adapting encryption algorithm based on the spatiotemporal chaos and ergodic matrix is proposed in this paper. First, the plain-image is divided into different blocks of the same size, and each block is sorted in ascending order to obtain the corresponding standard ergodic matrix. Then each block is encrypted by the spatiotemporal chaotic system and shuffled according to the standard ergodic matrix. Finally, all modules are rearranged to acquire the final encrypted image. In particular, the plain-image information is used in the initial conditions of the spatiotemporal chaos and the ergodic matrices, so different plain-images will be encrypted to obtain different cipherimages. Theoretical analysis and simulation results indicate that the performance and security of the proposed encryption scheme can encrypt the image effectively and resist various typical attacks.
基金the support of Network Communication Technology(NCT)Research Groups,FTSM,UKM in providing facilities for this research.This paper is supported under the Dana Impak Perdana UKM DIP-2018-040 and Fundamental Research Grant Scheme FRGS/1/2018/TK04/UKM/02/7.
文摘In this paper,we provide a new approach to data encryption using generalized inverses.Encryption is based on the implementation of weighted Moore–Penrose inverse A y MNenxmT over the nx8 constant matrix.The square Hermitian positive definite matrix N8x8 p is the key.The proposed solution represents a very strong key since the number of different variants of positive definite matrices of order 8 is huge.We have provided NIST(National Institute of Standards and Technology)quality assurance tests for a random generated Hermitian matrix(a total of 10 different tests and additional analysis with approximate entropy and random digression).In the additional testing of the quality of the random matrix generated,we can conclude that the results of our analysis satisfy the defined strict requirements.This proposed MP encryption method can be applied effectively in the encryption and decryption of images in multi-party communications.In the experimental part of this paper,we give a comparison of encryption methods between machine learning methods.Machine learning algorithms could be compared by achieved results of classification concentrating on classes.In a comparative analysis,we give results of classifying of advanced encryption standard(AES)algorithm and proposed encryption method based on Moore–Penrose inverse.
文摘Many symmetric and asymmetric encryption algorithms have been developed in cloud computing to transmit data in a secure form.Cloud cryptography is a data encryption mechanism that consists of different steps and prevents the attacker from misusing the data.This paper has developed an efficient algorithm to protect the data from invaders and secure the data from misuse.If this algorithm is applied to the cloud network,the attacker will not be able to access the data.To encrypt the data,the values of the bytes have been obtained by converting the plain text to ASCII.A key has been generated using the Non-Deterministic Bit Generator(NRBG)mechanism,and the key is XNORed with plain text bits,and then Bit toggling has been implemented.After that,an efficient matrix cipher encryption algorithm has been developed,and this algorithm has been applied to this text.The capability of this algorithm is that with its help,a key has been obtained from the plain text,and only by using this key can the data be decrypted in the first steps.A plain text key will never be used for another plain text.The data has been secured by implementing different mechanisms in both stages,and after that,a ciphertext has been obtained.At the end of the article,the latest technique will be compared with different techniques.There will be a discussion on how the present technique is better than all the other techniques;then,the conclusion will be drawn based on comparative analysis.
基金Supported by the National Natural Science Foundation of China (No. 61173036)
文摘The paper proposes a novel algorithm to get the encryption matrix. Firstly, a chaotic sequence generated by Chebyshev chaotic neural networks is converted into a series of low-order integer matrices from which available encryption matrices are selected. Then, a higher order encryption matrix relating real world application is constructed by means of tensor production method based on selected encryption matrices. The results show that the proposed algorithm can produce a "one-time pad cipher" encryption matrix with high security; and the encryption results have good chaos and auto-correlation with the natural frequency of the plaintext being hidden and homogenized.
文摘Any linear transform matrix can be used to easily calculate a consistent form, and a plurality of conversion can be easily connected together by matrix multiplication. When performing file transfers, you can encrypt files matrix transformation. Article presents a matrix-based electronic document encryption and decryption algorithm, which relies on a special class of matrices combinatorial problems, the method to improve the security of electronic document system is feasible and effective, and finally give the source code and programming software.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61672124,61370145,and 61173183)the Password Theory Project of the13th Five-Year Plan National Cryptography Development Fund,China(Grant No.MMJJ20170203)+1 种基金the Program for New Century Excellent Talents in Fujian Province Universitythe Natural Science Foundation of Fujian Province of China(Grant No.2018J01100)
文摘In this paper, first, we investigate a novel one-dimensional logistic-PWLCM(LP) modulation map which is derived from the logistic and PWLCM maps. Second, we propose a novel PCLML spatiotemporal chaos in pseudo-random coupling method that can accelerate the system behavior of the fully spatial chaos. Here, because the better chaotic properties include a wide range of parameter settings and better ergodicity than a logistic map, the LP is used in PCLML as f(x). The Kolmogorov–Sinai entropy density and universality and the bifurcation diagram are employed to investigate the chaotic behaviors of the proposed PCLML model. Finally, we apply the LP and PCLML chaotic systems to image encryption to improve the effectiveness and security of the encryption scheme. By combining self-generating matrix model M and dynamic substitution box(S-Box) methods, we design a new image encryption algorithm. Numerical simulations and security analysis have been carried out to demonstrate that the proposed algorithm has a high security level and can efficiently encrypt several different kinds of images into random-like images.
基金the National Natural Science Foundation of China,the State Key Program of National Natural Science of China,the Major Research Plan of the National Natural Science Foundation of China,Major State Basic Research Development Program of China (973 Program),the Hubei Natural Science Foundation of China
文摘The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and eneryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security,security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.
文摘Cloud computing, a recently emerged paradigm faces major challenges in achieving the privacy of migrated data, network security, etc. Too many cryptographic technologies are raised to solve these issues based on identity, attributes and prediction algorithms yet;these techniques are highly prone to attackers. This would raise a need of an effective encryption technique, which would ensure secure data migration. With this scenario, our proposed methodology Efficient Probabilistic Public Key Encryption(EPPKE) is optimized with Covariance Matrix Adaptation Evolution Strategies(CMA-ES). It ensures data integrity through the Luhn algorithm with BLAKE 2b encapsulation. This enables an optimized security to the data which is migrated through cloud. The proposed methodology is implemented in Open Stack with Java Language. It achieves better results by providing security compared to other existing techniques like RSA, IBA, ABE, PBE, etc.
基金This research was supported by the Researchers supporting program(TUMAProject-2021-27)Almaarefa University,Riyadh,Saudi Arabia.
文摘There are many cloud data security techniques and algorithms available that can be used to detect attacks on cloud data,but these techniques and algorithms cannot be used to protect data from an attacker.Cloud cryptography is the best way to transmit data in a secure and reliable format.Various researchers have developed various mechanisms to transfer data securely,which can convert data from readable to unreadable,but these algorithms are not sufficient to provide complete data security.Each algorithm has some data security issues.If some effective data protection techniques are used,the attacker will not be able to decipher the encrypted data,and even if the attacker tries to tamper with the data,the attacker will not have access to the original data.In this paper,various data security techniques are developed,which can be used to protect the data from attackers completely.First,a customized American Standard Code for Information Interchange(ASCII)table is developed.The value of each Index is defined in a customized ASCII table.When an attacker tries to decrypt the data,the attacker always tries to apply the predefined ASCII table on the Ciphertext,which in a way,can be helpful for the attacker to decrypt the data.After that,a radix 64-bit encryption mechanism is used,with the help of which the number of cipher data is doubled from the original data.When the number of cipher values is double the original data,the attacker tries to decrypt each value.Instead of getting the original data,the attacker gets such data that has no relation to the original data.After that,a Hill Matrix algorithm is created,with the help of which a key is generated that is used in the exact plain text for which it is created,and this Key cannot be used in any other plain text.The boundaries of each Hill text work up to that text.The techniques used in this paper are compared with those used in various papers and discussed that how far the current algorithm is better than all other algorithms.Then,the Kasiski test is used to verify the validity of the proposed algorithm and found that,if the proposed algorithm is used for data encryption,so an attacker cannot break the proposed algorithm security using any technique or algorithm.