Two key exchange protocols are proposed based on the hard problems on general linear groups GL（n

F） and symmetric groups Sn

which have high efficiency.At last it points out that the security of the key exchange algorithms 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.