2000 character limit reached
How to make RSA and some other encryptions probabilistic (1603.02031v1)
Published 7 Mar 2016 in cs.CR and math.GR
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.