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

• Articles • Previous Articles     Next Articles

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!