New probabilistic public-key encryption based on the RSA cryptosystem

Abstract We propose a novel probabilistic public-key encryption, based on the RSA cryptosystem. We prove that in contrast to the (standard model) RSA cryptosystem each user can choose his own encryption exponent from a more extensive set of positive integers than it can be done by the creator of the concrete RSA cryptosystem who chooses and distributes encryption keys among all users. Moreover, we show that the proposed encryption remains secure even in the case when the adversary knows the factors of the modulus