An efficient probabilistic encryption scheme
type: Item
instance of: scholarly article
title: An efficient probabilistic encryption scheme
zbMATH Open document ID: 0697.94005
DOI: 10.1016/0020-0190(90)90090-K
author: Lein Harn
author: Thomas Kiesler
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 4143903
zbMATH Keywords: probabilistic encryption algorithm
zbMATH Keywords: system security
zbMATH Keywords: primes
zbMATH Keywords: public key concept
zbMATH Keywords: digital signature
MaRDI profile type: Publication
cites work: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
cites work: Q3691050
cites work: New directions in cryptography
cites work: Probabilistic encryption
cites work: Improved Rabin's scheme with high efficiency
cites work: Q3803031
cites work: Hiding information and signatures in trapdoor knapsacks
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: A modification of the RSA public-key encryption procedure (Corresp.)
description: scientific article; zbMATH DE number 4143903