基于有限非阿贝尔群的密钥交换

Key Exchange Schemes Using Finite Non-Abilian Groups

从一般线性群GL(n,F)和对称群Sn上的困难问题出发,构造了几个密钥交换算法,新算法具有更高的效率.同时,指出基于一般线性群的密钥交换算法的安全性直接依赖于广义矩阵覆盖问题,基于对称群的密钥交换协议的安全性直接依赖于置换群上的共轭问题.

Two key exchange protocols are proposed based on the hard problems on general linear groups GL（n, F） and symmetric groups S,,, which have high efficiency. At last it points out that the security of the key exchange al gorithms based on general linear groups directly depends on how to solve the generalized matrix cover problems, and the algorithms based on symmetric groups are directly dependent on the conjugacy problems on some permutation groups.