首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于矩阵环的快速公钥密码算法
引用本文:巨春飞,仇晓涛,王保仓.基于矩阵环的快速公钥密码算法[J].山东大学学报(理学版),2012,47(9):56-59,87.
作者姓名:巨春飞  仇晓涛  王保仓
作者单位:1. 两京学院工程技术系,陕西西安,710123
2. 两安电子科技大学计算机网络与信息安仝教育部重点实验室,陕西西安,710071
3. 两安电子科技大学计算机网络与信息安仝教育部重点实验室,陕西西安710071 广西无线宽带通信与信号处理重点实验室资,广西桂林541004
基金项目:国家自然科学基金资助项目(61173152);陕西省自然科学基金资助项目(2012JM8005)
摘    要:针对资源受限的计算环境,提出了一个快速公钥密码算法。该密码算法通过使用一个特殊的矩阵分解问题从而避免了在加解密过程中使用计算量较大的模指数运算,因而具有更高的计算效率。分析指出:密码的安全性与整数分解问题有关,但是并不等价于整数分解问题。该密码算法由于使用了特殊的矩阵分解问题,能够抵抗各类私钥恢复攻击和格攻击,因此是一个快速高效的公钥密码。

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

Fast public key cryptosystem based on matrix ring
JU Chun-fei,QIU Xiao-tao,WANG Bao-cang.Fast public key cryptosystem based on matrix ring[J].Journal of Shandong University,2012,47(9):56-59,87.
Authors:JU Chun-fei  QIU Xiao-tao  WANG Bao-cang
Institution:2,3(1.Department of Engineering Technology,Xijing University,Xi’an 710123,Shaanxi,China; 2.Key Laboratory of Computer Networks & Information Security,Ministry of Education, Xidian University,Xi’an 710071,Shaanxi,China; 3.Guangxi Key Laboratory of Wireless Wideband Communication & Signal Processing,Guilin 541004,Guangxi,China)
Abstract: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 computational 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.
Keywords:public key cryptography  lattice reduction  security
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号