位置:成果数据库 > 期刊 > 期刊详情页
Cryptanalysis of Schemes Based on Pseudoinverse Matrix
  • ISSN号:1671-4512
  • 期刊名称:《华中科技大学学报:自然科学版》
  • 时间:0
  • 分类:TP305[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]School of Computer, Wuhan University, Wuhan 430072,Hubei, China, [2]Key Laboratory of Aerospace Information Security and TrustedComputing Ministry of Education, Wuhan 430072, Hubei, China
  • 相关基金:Supported by the National Natural Science Foundation of China ( 61303212, 61170080, 61202386), the State Key Program of National Natural Science of China( 61332019, U1135004), the Major Research Plan of the National Natural Science Foundation of China (91018008), Major State Basic Research Development Program of China (973 Program) (2014CB340600), the Natural Science Foundation of Hubei Province ( 2011CDIM53, 2014CFB440)
中文摘要:

Advances in quantum computation threaten to break public key cryptosystems that are based on the difficulty of factorization or the difficulty of discrete logariths, although, no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures up to now. The proposed new quasi-inverse based cryptography scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we illustrate that two of the quasi-inverse based cryptography are vulnerable to a structural attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. In addition, we conduct a detailed analysis on attack methods and provide some improved suggestions on these two schemes.

英文摘要:

Advances in quantum computation threaten to break public key eryptosystems that are based on the difficulty of fac- torization or the difficulty of discrete logariths, although , no quantum algorithms have been found to be able to solve certain mathematical problems on non-commutative algebraic structures up to now. The proposed new quasi-inverse based cryptography scheme is vulnerable to a linear algebra attack based on the probable occurrence of weak keys in the generation process. In this paper, we illustrate that two of the quasi-inverse based cryptography are vulnerable to a structural attack and that it only requires polynomial time to obtain the equivalent keys for some given public keys. In addition, we conduct a detailed analysis on attack methods and provide some improved suggestions on these two schemes.

同期刊论文项目
期刊论文 24 会议论文 2 著作 1
同项目期刊论文
期刊信息
  • 《华中科技大学学报:自然科学版》
  • 中国科技核心期刊
  • 主管单位:中华人民共和国教育部
  • 主办单位:华中科技大学
  • 主编:丁烈云
  • 地址:武汉珞喻路1037号
  • 邮编:430074
  • 邮箱:hgxbs@mail.hust.edu.cn
  • 电话:027-87543916 87544294
  • 国际标准刊号:ISSN:1671-4512
  • 国内统一刊号:ISSN:42-1658/N
  • 邮发代号:38-9
  • 获奖情况:
  • 全国优秀科技期刊,首届国家期刊奖,第二届全国优秀科技期刊评比一等奖,中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国化学文摘(网络版),美国数学评论(网络版),德国数学文摘,荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,英国科学文摘数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版)
  • 被引量:21013