基于矩阵环的快速公钥密码算法  

Fast public key cryptosystem based on matrix ring

作　　者：巨春飞 仇晓涛[2] 王保仓[2,3] 

机构地区：[1]两京学院工程技术系,陕西西安710123 [2]两安电子科技大学计算机网络与信息安仝教育部重点实验室,陕西西安710071 [3]广西无线宽带通信与信号处理重点实验室资,广西桂林541004

出　　处：《山东大学学报（理学版）》2012年第9期56-59,87,共5页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(61173152);陕西省自然科学基金资助项目(2012JM8005)

摘　　要：针对资源受限的计算环境,提出了一个快速公钥密码算法。该密码算法通过使用一个特殊的矩阵分解问题从而避免了在加解密过程中使用计算量较大的模指数运算,因而具有更高的计算效率。分析指出:密码的安全性与整数分解问题有关,但是并不等价于整数分解问题。该密码算法由于使用了特殊的矩阵分解问题,能够抵抗各类私钥恢复攻击和格攻击,因此是一个快速高效的公钥密码。A novel fast public key cryptosystem was proposed, which applies to resource constraint environments. The cryptosystem was designed based on a special matrix factorization problem to exclude the use of the costly operations of modular exponentiations during encryption and decryption, and thus the cryptosystem obtains a relatively high computa- tional efficiency. Analysis shows that the security of the cryptosystem is related to but not necessarily equivalent to the integer factorization problem. The cryptosystem is proved to be secure against some key recovery attacks and the lattice attack due to the application of the special matrix factorization problem. Therefore, the cryptosystem is fast and secure.

关 键 词：公钥密码学 格规约 安全性 

分 类 号：TN911.22[电子电信—通信与信息系统]