Research on a New Public Key Cryptosystem as Secure as Integer Factorization
Jiang Zheng-tao①; Zhang Jing-liang②; Wang Yu-min②
①School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100083, China; ②National Key Lab. of Integrated Service Networks, Xidian Univ., Xi’an 710071, China
Abstract：Constructing provably secure cryptographic primitives under weak assumptions can improve the security of cryptographic schemes efficiently. Further research on the construction of public-key cryptosystem is provided, and a new public-key encryption primitive is investigated. This scheme is more efficient than that of existing LUC cryptosystems. More over, the proposed scheme is provable secure and its security is proved to be equivalent to the factorization of RSA modulus. At last, an application in signature is suggested; forgery of signature is also equivalent to the factorization of RSA modulus.
姜正涛; 张京良; 王育民. 一种新的等价于大整数分解的公钥密码体制研究[J]. 电子与信息学报, 2008, 30(6): 1450-1452 .
Jiang Zheng-tao①; Zhang Jing-liang②; Wang Yu-min②. Research on a New Public Key Cryptosystem as Secure as Integer Factorization. , 2008, 30(6): 1450-1452 .
2008, Vol. 30 
