Security Proof of Public-key Encryption Algorithm Rabin-OAEP
DU Shu-qin · Jisuanji gongcheng · 2009
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.