基于REESSE1＋公钥密码体制的概率加密  

Probabilistic Encryption Based on REESSE1+Public Key Cryptosystem

作　　者：孙国栋[1] 苏盛辉[1,2] 徐茂智[1,3] 

机构地区：[1]北京工业大学计算机学院,北京100124 [2]扬州大学信息工程学院,江苏扬州225009 [3]北京大学数学科学学院,北京100871

出　　处：《计算机工程》2014年第12期78-82,共5页Computer Engineering

基　　金：国家“863”计划基金资助项目(2009AA01Z441);国家“973”计划基金资助项目(2007CB311100)

摘　　要：针对确定性公钥密码体制不能抵抗选择明文攻击的弱点,基于REESSE1+公钥密码体制设计2种概率加密方案,使同一明文对应的密文具有不确定性。方案1在明文比特序列的奇数位置插入相同长度的随机比特串,产生新的随机明文序列,并对该序列进行加密;方案2对公钥序列进行重新排列,使用新的公钥序列对明文进行加密。证明2种方案的正确性,并对其安全性和性能进行分析,结果表明,2种方案均可抵抗选择明文攻击,密码强度至少等价于基于离散对数问题的密码方案,同时,其加解密运行时间均少于基于RSA和剩余问题的概率密码方案。In order to overcome the weakness that deterministic public key cryptosystem can not resist the chosen plaintext attack,two probabilistic encryption schemes are proposed based on REESSE1 ＋ public key cryptosystem. The first scheme inserts a random bit sequence into the odd position of the bit sequence of plaintext, and produces a new random plaintext sequence which is encrypted. The second scheme generates a random permutation of the public key sequence,which is used to encrypt the plaintext. According to the two schemes,the ciphertext of a plaintext is uncertain. The correctness of the schemes is proved, and the security and performance of the schemes are also analyzed. Results show that,the two schemes can resist chosen plaintext attack and the cipher intensity of them is not lower than that of the scheme based on discrete logarithm problem. Besides,the encoding and decoding running time of the schemes are less than that of the scheme based on RSA and residuosity problem.

关 键 词：概率加密 REESSE1+公钥密码体制 多变量组合问题 非范子集积问题 选择明文攻击 互素序列 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]