计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2014年
12期
78-82
,共5页
概率加密%REESSE1+公钥密码体制%多变量组合问题%非范子集积问题%选择明文攻击%互素序列
概率加密%REESSE1+公鑰密碼體製%多變量組閤問題%非範子集積問題%選擇明文攻擊%互素序列
개솔가밀%REESSE1+공약밀마체제%다변량조합문제%비범자집적문제%선택명문공격%호소서렬
probabilistic encryption%REESSE1+ public key cryptosystem%multivariate permutation problem%anomalous subset product problem%chosen plaintext attack%coprime sequence
针对确定性公钥密码体制不能抵抗选择明文攻击的弱点,基于REESSE1+公钥密码体制设计2种概率加密方案,使同一明文对应的密文具有不确定性。方案1在明文比特序列的奇数位置插入相同长度的随机比特串,产生新的随机明文序列,并对该序列进行加密;方案2对公钥序列进行重新排列,使用新的公钥序列对明文进行加密。证明2种方案的正确性,并对其安全性和性能进行分析,结果表明,2种方案均可抵抗选择明文攻击,密码强度至少等价于基于离散对数问题的密码方案,同时,其加解密运行时间均少于基于 RSA和剩余问题的概率密码方案。
針對確定性公鑰密碼體製不能牴抗選擇明文攻擊的弱點,基于REESSE1+公鑰密碼體製設計2種概率加密方案,使同一明文對應的密文具有不確定性。方案1在明文比特序列的奇數位置插入相同長度的隨機比特串,產生新的隨機明文序列,併對該序列進行加密;方案2對公鑰序列進行重新排列,使用新的公鑰序列對明文進行加密。證明2種方案的正確性,併對其安全性和性能進行分析,結果錶明,2種方案均可牴抗選擇明文攻擊,密碼彊度至少等價于基于離散對數問題的密碼方案,同時,其加解密運行時間均少于基于 RSA和剩餘問題的概率密碼方案。
침대학정성공약밀마체제불능저항선택명문공격적약점,기우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.