Abstract:
This paper discuses about the security against adaptive chosen-ciphertext attack aiming at Rabin-OAEP algorithm. Construction of reasonable interaction between Adversary and Simulator is used to provide the inverse proposition of “Decomposition of large integer N=pq is difficult (for p,q are two large prime numbers), the Rabin-OAEP is secure against adaptive algorithm chosen-ciphertext attack.” Result proves claim that Rabin-OAEP is an security algorithm.
Key words:
public-key cryptography,
Rabin-OAEP algorithm,
adaptive chosen-ciphertext attack
摘要： 针对Rabin-OAEP算法在自适应选择密文攻击下是否安全，采用Adversary和Simulator进行的合理交互，论证“分解大整数N=pq是困难的(其中p, q为2个大素数)，则Rabin-OAEP算法在自适应选择密文攻击下是安全的”的逆否命题，结果证明了Rabin-OAEP算法的安全性。
关键词:
公钥密码,
Rabin-OAEP算法,
自适应选择密文攻击
CLC Number:
LIU Jia; XIE Fang-qing; DU Shu-qin. Security Proof of Public-key Encryption Algorithm Rabin-OAEP[J]. Computer Engineering, 2009, 35(16): 115-116.
刘 佳;谢芳清;杜淑琴. 公钥加密算法Rabin-OAEP安全性证明[J]. 计算机工程, 2009, 35(16): 115-116.