New probabilistic public-key encryption based on the RSA cryptosystem
-
Vitalii A. Roman'kov
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
Funding source: RFBR
Award Identifier / Grant number: 15.41.04312
© 2015 by De Gruyter
Articles in the same Issue
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels
Articles in the same Issue
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels
