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 1+(k−1)/1, where k is the security parameter and 1 the length of the encrypted message. Finally, the system can be used to sign signatures.
Cite
CITATION STYLE
APA
Jingmin, H., & Kaicheng, L. (1988). A new probabilistic encryption scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 330 LNCS, pp. 415–418). Springer Verlag. https://doi.org/10.1007/3-540-45961-8_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free