期刊文献+

Cryptanalysis of Cryptosystems Based on General Linear Group 被引量:1

Cryptanalysis of Cryptosystems Based on General Linear Group
下载PDF
导出
摘要 Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work. Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.
出处 《China Communications》 SCIE CSCD 2016年第6期217-224,共8页 中国通信(英文版)
基金 supported in part by the National Natural Science Foundation of China(Grant Nos.61303212,61170080,61202386) the State Key Program of National Natural Science of China(Grant Nos.61332019,U1135004) the Major Research Plan of the National Natural Science Foundation of China(Grant No.91018008) Major State Basic Research Development Program of China(973 Program)(No.2014CB340600) the Hubei Natural Science Foundation of China(Grant Nos.2011CDB453,2014CFB440)
关键词 一般线性群 密码分析 公钥密码系统 EIGAMAL 攻击方法 代数结构 量子计算机 时间复杂度 cryptography post quantum computational cryptography cryptanalysis non-abelian algebraic structures linear equations
  • 相关文献

参考文献5

二级参考文献69

  • 1PEI Shihui ZHAO Hongwei ZHAO Yongzhe.Public Key Cryptography Based on Ergodic Matrices over Finite Field[J].Wuhan University Journal of Natural Sciences,2006,11(6):1525-1528. 被引量:8
  • 2Tang Chuan, the advent of 16-qubit quantum computer. National Science Library, Chinese Academy of Sciences ((Letters on dynamic monitoring of scientific research)) , 2007,4:1-3.
  • 3Grover L K. A fast quantum mechanical algo- rithm for database search[C]//Proceedings of the twenty-eighth annual ACM symposium on Theory of computing. ACM, 1996: 212-219.
  • 4Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms ona quantum computer[J]. SIAM journal on com- puting, 1997, 26(5): 1484-1509.,.
  • 5Daniel J. Bernstein. Introduction to post-quan- tum cryptography. Post-Quantum Cryptography 2009, ppl-24.
  • 6Bennett C H, Bernstein E, Brassard G, et al. Strengths and weaknesses of quantum comput- ing[J]. SIAM Journal on Computing, 1997, 26(5): 1510-1523.
  • 7Perlner R A, Cooper D A. Quantum resistan public key cryptography: a survey[C]//Proceedt ings of the 8th Symposium on Identity and Trus1 on the Internet. ACM, 2009: 85-93. /.
  • 8Okamoto T, Tanaka K, Uchiyama S. Quantum public-key cryptosystems[C]//Advances in Cryptology--CRYPTO 2000. Springer Berlin Heidelberg, 2000: 147-165.
  • 9Cao 7" Dong X, Wang L. New Public Key Cryp- tosystems Using Polynomials over Non-com- mutative Rings[J]. IACR Cryptology ePrint Archi- ve, 2007, 2007: 9.
  • 10Myasnikov A G, Shpilrain V, Ushakov A. Non-commutative cryptography and comple- xity of group-theoretic problems[M]. American.

共引文献42

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部