Analysis of an asymmetric cryptosystem based on boolean matrices and permutations

With widespread use of internet based services and applications, there is a real need for ensuring the reliability and security of data transmitted over this platform. One of the major tools to guarantee the security of information is data encryption. However, the proposed encryption methodology is usually expected to have some key characteristics to be applicable in computer networks. A suitable encryption algorithm should be fast, reliable, and, more importantly, it should impose less metadata to the original data. Aiming at these characteristics, an asymmetric encryption system has been proposed recently based on Boolean product of matrices. This cryptosystem is analyzed in this paper from another point of view. Here, it is shown that Boolean information is really sensitive, and a minor change in binary data might lead to a significant change in the retrieved values through the decryption procedure. This issue becomes even more critical when the application area is a computer network in which numerous incidents may happen to data before they reach the desired destination; for instance, different kinds of noises are capable of changing the originality of information. Simulations and experiments conducted in this paper show that this fast cryptosystem is not a suitable tool to ensure the security of data in computer networks.