RSA的非完全映射特征  

Non-complete mappings characteristics of RSA

作　　者：徐结绿[1] 徐汉良[1] 黄红梅[1] 吕述望[1] 

机构地区：[1]中国科学技术大学研究生院信息安全国家重点实验室,北京100039

出　　处：《通信学报》2003年第7期113-118,共6页Journal on Communications

基　　金：国家自然科学基金资助项目(60173015);国家攀登计划"973"基金资助项目(G1999035808)

摘　　要：基于完全映射概念,给出了随机置换像与原像的差值特征,通过RSA加密函数像与原像部分同差个数下界的推导,证明了RSA的加密函数不具有完全映射特征,并据此给出了对RSA数字签名方案的一种攻击设想。On the basis of the complete mappings concept, this paper gives difference value characteristics between image and inverse image of random permutation. Through giving lower bound of the number of some same difference value between image and inverse image, it is proved that RSA encryption function is not a complete mappings. At the same time, a conceive of attack to RSA digital signature scheme is given based on non-complete mappings characteristics of RSA.

关 键 词：RSA 非完全映射 全向置换 公钥密码体制 多项式同余方程 数字签名 密码设计 

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