J4 ›› 2013, Vol. 48 ›› Issue (09): 22-28.

• Articles • Previous Articles     Next Articles

Security analysis of fast public key cryptosystem on matrix ring

GU Chun-sheng1,2, WU Fang-sheng2, JING Zheng-jun2,3, YU Zhi-min2   

  1. 1.School of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, Anhui, China;
    2. School of Computer Engineering, Jiangsu University of Technology, Changzhou 213001, Jiangsu, China;
    3. School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing 210003, Jiangsu, China
  • Received:2013-03-01 Online:2013-09-20 Published:2013-09-25


It is very important to analyze the security of fast public key cryptosystem suitable for computing devices with limited resources. By applying lattice reduction algorithm, it is not more difficult than the integer factorization problem to break the fast public key cryptosystem based on matrix ring. That is, given an oracle of factoring integers, there exists a polynomial time algorithm which solves the secret key from the public key. The correctness of security analysis is demonstrated by computational experiments.

Key words:  public key cryptosystem; integer factorization; cryptanalysis; lattice reduction

No related articles found!
Full text



No Suggested Reading articles found!