Papers
Topics
Authors
Recent
Search
2000 character limit reached

How to make RSA and some other encryptions probabilistic

Published 7 Mar 2016 in cs.CR and math.GR | (1603.02031v1)

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.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Vitalii Roman'kov 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up