How to make RSA and some other encryptions probabilistic
This addresses security vulnerabilities in widely used encryption algorithms like RSA, Diffie-Hellman, and ElGamal by enhancing their probabilistic properties, though it appears incremental as it builds on existing methods.
The paper tackles the problem of making RSA and other deterministic encryption schemes probabilistic by introducing a new subgroup-related encryption scheme, which is claimed to be potentially semantically secure under reasonable assumptions.
A new scheme of probabilistic subgroup-related encryption is introduced. Some applications of this scheme based on the RSA, Diffie-Hellman and ElGamal encryption algorithms are described. Security assumptions and main advantages of this scheme are discussed. We outline that this scheme is potentially semantically secure under reasonable cryptographic assumptions.