| 基于椭圆曲线的KDM安全公钥加密方案 |
| |
| 引用本文： | 谢小容,王鲲鹏. 基于椭圆曲线的KDM安全公钥加密方案[J]. 计算机工程, 2012, 38(23): 19-23 |
| |
| 作者姓名： | 谢小容 王鲲鹏 |
| |
| 作者单位： | 1. 中国科学院研究生院信息安全国家重点实验室,北京,100049
2. 中国科学院研究生院信息工程所,北京,100195 |
| |
| 基金项目： | 国家自然科学基金资助项目，中国科学院战略性先导专项基金资助项目"海云信息安全共性关键技术研究" |
| |
| 摘 要： | 某些场合下敌手能够获取与私钥有关消息的密文，大多现有加密方案在上述情况下是不安全的。为抵抗这种攻击，给出一般子群不可区分困难假设的一个实例——椭圆曲线子群不可区分困难假设，并设计相应的归约算法。在此基础上，提出一个基于环 上椭圆曲线的公钥加密方案，并将该方案中的密文不可区分问题归约到椭圆曲线子群不可区分困难的假设上。分析结果证明，该方案在此假设下是安全的。
|
| 关 键 词： | 密钥相关消息安全 公钥加密方案 椭圆曲线 子群不可区分 环 自加密 |
| 收稿时间： | 2012-02-27 |
Public Key Encryption Scheme with KDM Security Based on Elliptic Curves |
| |
| XIE Xiao-rong , WANG Kun-peng. Public Key Encryption Scheme with KDM Security Based on Elliptic Curves[J]. Computer Engineering, 2012, 38(23): 19-23 |
| |
| Authors: | XIE Xiao-rong WANG Kun-peng |
| |
| Affiliation: | (1. State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing 100049, China; 2. Institute of Information Engineering, Graduate University of Chinese Academy of Sciences, Beijing 100195, China) |
| |
| Abstract: | 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 and reduce the indistinguishability of the ciphertexts to elliptic curve subgroup indistinguishability assumption. The scheme is proved secure under the assumption. |
| |
| Keywords: | Key Dependent Message(KDM) security public key encryption scheme elliptic curve subgroup indistinguishability ring self-encryption |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
