We introduce block maps for subfactors and study their dynamic systems. We prove that the limit points of the dynamic system are positive multiples of biprojections and zero. For the Z2 case, the asymptotic phenomenon...We introduce block maps for subfactors and study their dynamic systems. We prove that the limit points of the dynamic system are positive multiples of biprojections and zero. For the Z2 case, the asymptotic phenomenon of the block map coincides with that of the 2 D Ising model. The study of block maps requires a further development of our recent work on the Fourier analysis of subfactors. We generalize the notion of sum set estimates in additive combinatorics for subfactors and prove the exact inverse sum set theorem. Using this new method, we characterize the extremal pairs of Young’s inequality for subfactors, as well as the extremal operators of the Hausdorff-Young inequality.展开更多
In order to improve communication security, proposed a chaotic block cryptographic scheme based on the coupled piecewise nonlinear map. Using the coupled chaotic systems to generate random binary sequences, a key-depe...In order to improve communication security, proposed a chaotic block cryptographic scheme based on the coupled piecewise nonlinear map. Using the coupled chaotic systems to generate random binary sequences, a key-dependent shill approach permated the plain-text block and then using the classical chaotic masking technique encrypted the plain-text block. Simulation results show that the proposed algorithm has excellent cryptographic properties such as diffusion and confusion properties and it can resist the know plaintext attacks and chosen plain-text attacks.展开更多
In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simul- taneously. The cipher-text image is divided into blocks and each block has k x k pixels, while the...In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simul- taneously. The cipher-text image is divided into blocks and each block has k x k pixels, while the pixels of the plain-text are scanned one by one. Four logistic maps are used to generate the encryption key stream and the new place in the cipher image of plain image pixels, including the row and column of the block which the pixel belongs to and the place where the pixel would be placed in the block. After encrypting each pixel, the initial conditions of logistic maps would be changed ac- cording to the encrypted pixel＇s value; after encrypting each row of plain image, the initial condition would also be changed by the skew tent map. At last, it is illustrated that this algorithm has a faster speed, big key space, and better properties in withstanding differential attacks, statistical analysis, known plaintext, and chosen plaintext attacks.展开更多
Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes ...Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes up 90% time-consuming in typical motion estimation-based depth-map generation algorithms. In order to reduce the computational complexity, in this paper a new fast depth-map generation algorithm based on motion search is developed, in which a fast diamond search algorithm is adopted to decide whether a 16x16 or 4x4 block size is used based on Sobel operator in the motion search module to obtain a sub-depth-map. Then the sub-depth-map will be fused with the sub-depth-maps gotten from depth from color component Cr and depth from linear perspective modules to compensate and refine detail of the depth-map, finally obtain a better depth-map. The simulation results demonstrate that the new approach can greatly reduce over 50% computational complexity compared to other existing methods.展开更多
In this paper, we propose a novel block cryptographic scheme based on a spatiotemporal chaotic system and a chaotic neural network （CNN）. The employed CNN comprises a 4-neuron layer called a chaotic neuron layer （...In this paper, we propose a novel block cryptographic scheme based on a spatiotemporal chaotic system and a chaotic neural network （CNN）. The employed CNN comprises a 4-neuron layer called a chaotic neuron layer （CNL）, where the spatiotemporal chaotic system participates in generating its weight matrix and other parameters. The spatiotemporal chaotic system used in our scheme is the typical coupled map lattice （CML）, which can be easily implemented in parallel by hard- ware. A 160-bit-long binary sequence is used to generate the initial conditions of the CML. The decryption process is symmetric relative to the encryption process. Theoretical analysis and experimental results prove that the block cryptosys- tem is secure and practical, and suitable for image encryption.展开更多
Digital image encryption based on Joseph circle and Chaotic system has become a hot spot in the research of image encryption. An encryption algorithm based on improved Josephus loop and logistic mapping is proposed to...Digital image encryption based on Joseph circle and Chaotic system has become a hot spot in the research of image encryption. An encryption algorithm based on improved Josephus loop and logistic mapping is proposed to scrambling blocks in this paper. At first, the original image is scrambled by using logistic mapping to obtain the encrypted image, and then the encrypted image is divided into many blocks. Finally, the position of the blocked image is scrambled by using the improved Josephus ring to get the encrypted image. According to the experiments, the information entropy of the encrypted image reaches 7.99 and the adjacent correlations in three directions are within ±0.1. The experimental results show that the proposed algorithm has advantages of large key space, high key sensitivity and can effectively resist the attacks of statistical analysis and gray value analysis. It has good encryption effect on digital image encryption.展开更多
基金supported by National Natural Science Foundation of China (Grant No. A010602)National Excellent Doctoral Dissertation of China (Grant No. 201116)+2 种基金supported by the Templeton Religion Trust (Grant Nos. TRT0080 and TRT0159)an AMS-Simons Travel Grantsupported by National Natural Science Foundation of China (Grant Nos. 11771413 and 11401554)
文摘We introduce block maps for subfactors and study their dynamic systems. We prove that the limit points of the dynamic system are positive multiples of biprojections and zero. For the Z2 case, the asymptotic phenomenon of the block map coincides with that of the 2 D Ising model. The study of block maps requires a further development of our recent work on the Fourier analysis of subfactors. We generalize the notion of sum set estimates in additive combinatorics for subfactors and prove the exact inverse sum set theorem. Using this new method, we characterize the extremal pairs of Young’s inequality for subfactors, as well as the extremal operators of the Hausdorff-Young inequality.
基金Supported by the National Natural Science Foun-dation of China (60573047) the Natural Science Foundation of Chongqing Science and Technology Committee (CSTC,2005B2286) the Applying Basic Research of Chongqing Education Committee(kj051501)
文摘In order to improve communication security, proposed a chaotic block cryptographic scheme based on the coupled piecewise nonlinear map. Using the coupled chaotic systems to generate random binary sequences, a key-dependent shill approach permated the plain-text block and then using the classical chaotic masking technique encrypted the plain-text block. Simulation results show that the proposed algorithm has excellent cryptographic properties such as diffusion and confusion properties and it can resist the know plaintext attacks and chosen plain-text attacks.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61370145,61173183,and 60973152)the Doctoral Program Foundation of Institution of Higher Education of China(Grant No.20070141014)+2 种基金the Program for Liaoning Excellent Talents in University,China(Grant No.LR2012003)the National Natural Science Foundation of Liaoning Province,China(Grant No.20082165)the Fundamental Research Funds for the Central Universities,China(Grant No.DUT12JB06)
文摘In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simul- taneously. The cipher-text image is divided into blocks and each block has k x k pixels, while the pixels of the plain-text are scanned one by one. Four logistic maps are used to generate the encryption key stream and the new place in the cipher image of plain image pixels, including the row and column of the block which the pixel belongs to and the place where the pixel would be placed in the block. After encrypting each pixel, the initial conditions of logistic maps would be changed ac- cording to the encrypted pixel＇s value; after encrypting each row of plain image, the initial condition would also be changed by the skew tent map. At last, it is illustrated that this algorithm has a faster speed, big key space, and better properties in withstanding differential attacks, statistical analysis, known plaintext, and chosen plaintext attacks.
文摘Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes up 90% time-consuming in typical motion estimation-based depth-map generation algorithms. In order to reduce the computational complexity, in this paper a new fast depth-map generation algorithm based on motion search is developed, in which a fast diamond search algorithm is adopted to decide whether a 16x16 or 4x4 block size is used based on Sobel operator in the motion search module to obtain a sub-depth-map. Then the sub-depth-map will be fused with the sub-depth-maps gotten from depth from color component Cr and depth from linear perspective modules to compensate and refine detail of the depth-map, finally obtain a better depth-map. The simulation results demonstrate that the new approach can greatly reduce over 50% computational complexity compared to other existing methods.
基金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)
文摘In this paper, we propose a novel block cryptographic scheme based on a spatiotemporal chaotic system and a chaotic neural network （CNN）. The employed CNN comprises a 4-neuron layer called a chaotic neuron layer （CNL）, where the spatiotemporal chaotic system participates in generating its weight matrix and other parameters. The spatiotemporal chaotic system used in our scheme is the typical coupled map lattice （CML）, which can be easily implemented in parallel by hard- ware. A 160-bit-long binary sequence is used to generate the initial conditions of the CML. The decryption process is symmetric relative to the encryption process. Theoretical analysis and experimental results prove that the block cryptosys- tem is secure and practical, and suitable for image encryption.
文摘Digital image encryption based on Joseph circle and Chaotic system has become a hot spot in the research of image encryption. An encryption algorithm based on improved Josephus loop and logistic mapping is proposed to scrambling blocks in this paper. At first, the original image is scrambled by using logistic mapping to obtain the encrypted image, and then the encrypted image is divided into many blocks. Finally, the position of the blocked image is scrambled by using the improved Josephus ring to get the encrypted image. According to the experiments, the information entropy of the encrypted image reaches 7.99 and the adjacent correlations in three directions are within ±0.1. The experimental results show that the proposed algorithm has advantages of large key space, high key sensitivity and can effectively resist the attacks of statistical analysis and gray value analysis. It has good encryption effect on digital image encryption.
