多变量密码中布尔矩阵的一种新的构造方法

在多变量公钥密码体制的设计中，通常是先寻找一组容易求解的非线性方程组作为中心映射，然后对它进行一系列的变形，使容易求解的非线性方程组变换成求解困难的非线性方程组。非线性方程组的系数即一个大型的布尔矩阵，在加密和解密的变形中需要其满足可逆等一些特定的条件，因此需要构造一个求逆容易的布尔矩阵。丈中分析了陈勤等给出的大型可逆布尔矩阵生成算法，将这个复杂的算法进行了简化，并给出了一种新的构造矩阵的方法。

A Novel Construction Method for Large-Scale Boolean Matrix in Multivariate Public-Key Cryptosystem

In the design of Multivariate Public-Key Cryptosystems, usually a set of nonlinear equations easy to solve are first found out and taken for central mapping, and a series of deformations are carried out, then this set of equations are transformed into a set of nonlinear equations difficult to solve. A large-scale Boolean matrix, that is the coefficients of non-linear equations, must satisty some specific conditions in the deformation process of encryption and decryption, for example, the reversibility, thus needing to constract a Boolean matrix easy to reversibly solve. In this paper, the algorithm of generating large-scale boolean matrix given by CHEN Oin is analyzed, and simplified, then a novel construction method for large-scale Boolean matrix is proposed.