Security on public key encryption scheme based on ergodic matrices

被引：0
|
作者：
School of Computer Engineering, Jiangsu University of Technology, Changzhou [1 ]
Jiangsu
213001, China
不详 [2 ]
Anhui
230027, China
不详 [3 ]
Jiangsu
210003, China
机构：
[1] School of Computer Engineering, Jiangsu University of Technology, Changzhou, 213001, Jiangsu
[2] School of Computer Science and Technology, University of Science and Technology of China, Hefei, 230027, Anhui
[3] School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, 210003, Jiangsu
来源：
Tien Tzu Hsueh Pao | / 10卷 / 2081-2085期
关键词：
Discrete logarithm problem; Ergodic matrix; Public key cryptography; Security analysis;
D O I：
10.3969/j.issn.0372-2112.2014.10.033
中图分类号：
学科分类号：
摘要：
For the public key encryption scheme based on the ergodic matrices constructed by Pei et al., this paper proves that breaking this scheme is not harder than solving polynomial discrete logarithm problem on finite field applying the properties of ergodic matrices and linearization method. Thus, we show that their proof of security is not correct for this public key encryption scheme. ©, 2014, Tien Tzu Hsueh Pao/Acta Electronica Sinica. All right reserved.
引用
收藏
页码：2081 / 2085
页数：4
相关论文
共 14 条
  • [1] Yu J., Cheng X.G., Li F.G., Et al., Provably secure intrusion-resilient public-key encryption scheme in the standard model, Journal of Software, 24, 2, pp. 266-278, (2013)
  • [2] Du H.-Z., Huang M.-J., Wen Q.-Y., Efficient and provably-secure certificateless aggregate signature scheme, Acta Electronica Sinica, 41, 1, pp. 72-76, (2013)
  • [3] Kang L., Tang X.-H., Fan J., Efficient certificate-based public-key encryption scheme, Acta Electronica Sinica, 36, 10, pp. 2055-2059, (2008)
  • [4] Shor P.W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM Journal on Computing, 26, 1, pp. 1484-1509, (1997)
  • [5] Proos J., Zalka C., Shor's discrete logarithm quantum algorithm for elliptic curves, Quantum Information and Computation, 3, 4, pp. 317-344, (2003)
  • [6] Fu X.-Q., Bao W.-S., Zhou C., Et al., Quantum algorithm for prime factorization with high probability, Acta Electronica Sinica, 39, 1, pp. 35-39, (2011)
  • [7] Zhao Y.-Z., Zhao B., Pei S.-H., On the properties of the ergodic matrix over finite field, Acta Mathematica Sinica, 55, 3, pp. 457-468, (2012)
  • [8] Zhao Y.-Z., Pei S.-H., Wang H.-J., Et al., Using the ergodic matrices over finite field to construct the dynamic encryptor, Journal of Chinese Computer Systems, 28, 11, pp. 2010-2014, (2007)
  • [9] Pei S.-H., Zhao H.-W., Zhao Y.-Z., Public key cryptography based on ergodic matrices over finite field, Wuhan University Journal of Natural Sciences, 11, 6, pp. 1525-1528, (2006)
  • [10] Zhao Y., Jiang Z., Huang S., Implementation of Shamir's three pass protocol based on ergodic matrix over finite field, Journal of Chinese Computer Systems, 27, 6, pp. 986-991, (2006)
12