一种新的等价于大整数分解的公钥密码体制研究  

Research on a New Public Key Cryptosystem as Secure as Integer Factorization

作　　者：姜正涛[1] 张京良[2] 王育民[2] 

机构地区：[1]北京航空航天大学计算机学院,北京100083 [2]西安电子科技大学综合业务网国家重点实验室,西安710071

出　　处：《电子与信息学报》2008年第6期1450-1452,共3页Journal of Electronics & Information Technology

基　　金：中国博士后科学基金项目(20060400035);国家自然科学基金重点项目(69931010);国家973计划(G1999035803)资助课题

摘　　要：在弱的安全假设下构造可证明安全的密码体制原型可以有效提高密码体制的安全性,该文对用Lucas序列构造公钥密码体制做进一步研究,给出一种新的可证明安全的密码体制原型,该密码体制的加、解密效率比现有的LUC密码体制效率高,并证明它的安全性等价于分解RSA模数,最后给出该体制在签名方面的应用,伪造签名等价于分解RSA模数。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.

关 键 词：公钥加密体制 LUCAS序列 Lucas二次(非)剩余 整数分解 签名 

分 类 号：TN918[电子电信—通信与信息系统]