An efficient probabilistic encryption scheme
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.
- A method for obtaining digital signatures and public-key cryptosystems
- A modification of the RSA public-key encryption procedure (Corresp.)
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- Hiding information and signatures in trapdoor knapsacks
- scientific article; zbMATH DE number 3915608 (Why is no real title available?)
- scientific article; zbMATH DE number 4070802 (Why is no real title available?)
- Improved Rabin's scheme with high efficiency
- New directions in cryptography
- Probabilistic encryption
- Probabilistic encryption
- On using primes for public key encryption systems
- A knapsack-based probabilistic encryption scheme
- A generalized scheme for data encryption technique using a randomized matrix key
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- scientific article; zbMATH DE number 4070802 (Why is no real title available?)
- scientific article; zbMATH DE number 169375 (Why is no real title available?)
- Public-key encryption algorithm incorporating error detection
- A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy
- Efficient Encryption From Random Quasi-Cyclic Codes
- Efficient probabilistic public-key cryptosystem based on the diffie-hellman problem
This page was built for publication: An efficient probabilistic encryption scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912074)