Fast asymmetric cryptosystem based on Boolean product of matrices
Yeghisabet Alaverdyan, Gevorg I. Margarov · 2009
Given premises for constructing a fast asymmetric algorithm based on Boolean product of matrices. Description of the encryption/decryption process based on Boolean product of matrices involving Boolean permutations and the structure of public and secret key pairs are proposed. The security of such asymmetric cryptosystem is based on the difficulty of matrices decomposition and large composite Boolean permutations inversion. A quantitative analysis of stability of public key cryptosystems based on Boolean product of matrices is given.