您的位置:山东大学 -> 科技期刊社 -> 《山东大学学报(理学版)》

J4 ›› 2012, Vol. 47 ›› Issue (9): 56-59.

• 电子技术与信息 • 上一篇    下一篇

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

巨春飞1,仇晓涛2,王保仓2,3   

  1. 1. 西京学院工程技术系, 陕西 西安 710123;
    2. 西安电子科技大学计算机网络与信息安全教育部重点实验室, 陕西 西安 710071;
    3. 广西无线宽带通信与信号处理重点实验室资, 广西 桂林 541004
  • 收稿日期:2012-07-03 出版日期:2012-09-20 发布日期:2012-09-24
  • 作者简介:巨春飞(1974- ),女,讲师,从事密码学及网络安全的研究. Email: jchunfei@sina.com
  • 基金资助:

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

Fast public key cryptosystem based on matrix ring

JU Chun-fei1, QIU Xiao-tao2, WANG Bao-cang2,3   

  1. 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
  • Received:2012-07-03 Online:2012-09-20 Published:2012-09-24

摘要:

针对资源受限的计算环境,提出了一个快速公钥密码算法。该密码算法通过使用一个特殊的矩阵分解问题从而避免了在加解密过程中使用计算量较大的模指数运算,因而具有更高的计算效率。分析指出:密码的安全性与整数分解问题有关,但是并不等价于整数分解问题。该密码算法由于使用了特殊的矩阵分解问题,能够抵抗各类私钥恢复攻击和格攻击,因此是一个快速高效的公钥密码。

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

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.

Key words:  public key cryptography; lattice reduction; security

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!