An efficient probabilistic encryption scheme (Q912074)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4143903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient probabilistic encryption scheme |
scientific article; zbMATH DE number 4143903 |
Statements
An efficient probabilistic encryption scheme (English)
0 references
1990
0 references
In this paper we present a new probabilistic encryption algorithm in which system security is polynomially secure. We first review and develop some properties associated with the quadratic residue modulo n, where n is a product of two primes, each congruent to 3 modulo 4. Then we generalize these properties to the case where n is a product of any number of such primes. The encryption algorithm utilizes the public key concept and iteratively encrypts a sequence of single bit or of multiple bits. The scheme provides for a digital signature as well.
0 references
probabilistic encryption algorithm
0 references
system security
0 references
primes
0 references
public key concept
0 references
digital signature
0 references
0 references
0.8540667295455933
0 references
0.8461719751358032
0 references
0.8026861548423767
0 references
