How to make RSA and some other encryptions probabilistic
Cryptography and Security
2016-03-08 v1 Group Theory
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.
Keywords
Cite
@article{arxiv.1603.02031,
title = {How to make RSA and some other encryptions probabilistic},
author = {Vitalii Roman'kov},
journal= {arXiv preprint arXiv:1603.02031},
year = {2016}
}
Comments
7 pages