A Novel Multiband Remote-Sensing Image Encryption Algorithm Based on Dual-Channel Key Transmission Model

With the rapid development of remote sensing technology, satellite remote sensing images have been involved in many areas of people’s lives. Remote sensing images contain military secrets, land profiles, and other sensitive data, so it is urgent to encrypt remote sensing images. This paper proposes a dual-channel key transmission model. The plaintext related key is embedded into the ciphertext image through bit-level key hiding transmission strategy, which enhanced the ability of ciphertext image to resist known-plaintext attack and chosen plaintext attack. In addition, a multiband remote sensing image encryption algorithm based on Boolean cross-scrambling and semi-tensor product diffusion is designed. Firstly, the pixel positions of each band of the remote sensing image are disturbed. Then, the random sequence generated by the four-dimensional chaotic system is processed and deformed to obtain a Boolean matrix. Based on the generated Boolean matrix and certain rules, the cross-confusion between the bands is carried out. Finally, the semi-tensor product operation is used in the diffusion process. Simulation results and experimental analysis show that the proposed algorithm obtains a larger key space and has stronger antiattack ability than other remote sensing image encryption algorithms. It can meet the security transmission of multiband remote sensing image in open space.

Linear Operators That Preserve Arctic Ranks of Boolean Matrices

We study some properties of arctic rank of Boolean matrices. We compare the arctic rank with Boolean rank and term rank of a given Boolean matrix. Furthermore, we obtain some characterizations of linear operators that preserve arctic rank on Boolean matrix space.

Recent Developments in Boolean Matrix Factorization

The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra. While the problem is computationally hard, it is also attractive because the binary nature of the factor matrices makes them highly interpretable. In the last decade, BMF has received a considerable amount of attention in the data mining and formal concept analysis communities and, more recently, the machine learning and the theory communities also started studying BMF. In this survey, we give a concise summary of the efforts of all of these communities and raise some open questions which in our opinion require further investigation.