A new probabilistic encryption scheme

Authors:
H. Jingmin;L. Kaicheng
Affiliations:
Tsinghua Univ., Beijing, Peoples Republic of China;Tsinghua Univ., Beijing, Peoples Republic of China
Venue:
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Year:
1988

Citing 5
Cited 0

A simple unpredictable pseudo random number generator

SIAM Journal on Computing
An efficient probabilistic public key encryption scheme which hides all partial information

Proceedings of CRYPTO 84 on Advances in cryptology
The notion of security for probabilistic cryptosystems

Proceedings on Advances in cryptology---CRYPTO '86
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new probabilistic public key cryptosystem. The system is polynomially secure. Furthermore, it is highly efficient in that it's message expansion is l+(k-1)/1, where k is the security parameter and l the length of the encrypted message. Finally, the system can be used to sign signatures.