'Provable Security' for OAEP+-RSA and SAEP-Rabin

Abstract

In this thesis we give a mathematical definition for indistinguishable security. This definition is applied on two encryption padding protocols. We find that the SAEP-Rabin protocol is preferred to use above OAEP-RSA. In practice this is not done. This stresses the importance of the credibility, accessibility and understandability of the field of 'provable security'.