作者：谢小容[1]王鲲鹏[2]XIE Xiao-rong,WANG Kun-peng(1.State Key Laboratory of Information Security,Graduate University of ChineseAcademy of Sciences,Beijing 100049,China;2.Institute of Information Engineering,Graduate University of ChineseAcademy of Sciences,Beijing 100195,China)
出处：《计算机工程》第23期19-23,共5页Computer Engineering
基金：国家自然科学基金资助项目(60970153); 中国科学院战略性先导专项基金资助项目“海云信息安全共性关键技术研究”(XDA06010702)
摘要：某些场合下敌手能够获取与私钥有关消息的密文,大多现有加密方案在上述情况下是不安全的。为抵抗这种攻击,给出一般子群不可区分困难假设的一个实例——椭圆曲线子群不可区分困难假设,并设计相应的归约算法。在此基础上,提出一个基于环Z N2上椭圆曲线的公钥加密方案,并将该方案中的密文不可区分问题归约到椭圆曲线子群不可区分困难的假设上。分析结果证明,该方案在此假设下是安全的。Most public key encryption schemes are unsecure,if a polynomial time adversary can get ciphertexts that are dependent on the secret key.In order to defend the attacks,this paper gives an instance of the general subgroup indistinguishability assumption——elliptic curve subgroup indistinguishability assumption and a reduction algorithm.It is the first to construct a public key scheme based on elliptic curves over ring Z N2and reduce the indistinguishability of the ciphertexts to elliptic curve subgroup indistinguishability assumption.The scheme is proved secure under the assumption.
