Fast asymmetric cryptosystem based on Boolean product of matrices

Stability of the public key cryptosystem based on Boolean product of matrices

“…Table 1 shows, that the mapping of the binary integers between 0 and 2 n-1 into Boolean functions values is not a bijective procedure. Also the Boolean permutation, formed by any k components of the public key, is hard to invert due to own largeness [3], so the cryptosystem cannot be easily broken. To provide this, Boolean permutation with low linearity has to be chosen [3].…”