A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are con...A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.展开更多
We primarily provide several estimates for the heat kernel defined on the 2-dimensional simple random walk. Additionally, we offer an estimate for the heat kernel on high-dimensional random walks, demonstrating that t...We primarily provide several estimates for the heat kernel defined on the 2-dimensional simple random walk. Additionally, we offer an estimate for the heat kernel on high-dimensional random walks, demonstrating that the heat kernel in higher dimensions converges rapidly. We also compute the constants involved in the estimate for the 1-dimensional heat kernel. Furthermore, we discuss the general case of on-diagonal estimates for the heat kernel.展开更多
In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the nu...Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the numbers of eigen vance of A∈PD_0(R)\DD_0(R)are equal to the numbers of a_(ii),i∈N in positive and negative real part respectively.Some couter examples are given which present the condnions can not be omitted.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.62105004 and 52174141)the College Student Innovation and Entrepreneurship Fund Project(Grant No.202210361053)+1 种基金Anhui Mining Machinery and Electrical Equipment Coordination Innovation Center,Anhui University of Science&Technology(Grant No.KSJD202304)the Anhui Province Digital Agricultural Engineering Technology Research Center Open Project(Grant No.AHSZNYGC-ZXKF021)。
文摘A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.
文摘We primarily provide several estimates for the heat kernel defined on the 2-dimensional simple random walk. Additionally, we offer an estimate for the heat kernel on high-dimensional random walks, demonstrating that the heat kernel in higher dimensions converges rapidly. We also compute the constants involved in the estimate for the 1-dimensional heat kernel. Furthermore, we discuss the general case of on-diagonal estimates for the heat kernel.
文摘In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
文摘Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the numbers of eigen vance of A∈PD_0(R)\DD_0(R)are equal to the numbers of a_(ii),i∈N in positive and negative real part respectively.Some couter examples are given which present the condnions can not be omitted.
