On Public-Key Cryptosystems Built Using Polynomial Rings

4Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the paper, a public-key cryptosystem that is, as a matter of fact, a modification of the Merkle-Hellman system has been described. However, unlike the Merkle-Hellman system, it has been built using a polynomial ring. Finally, its quality has been given.

Cite

CITATION STYLE

APA

Pieprzyk, J. P. (1986). On Public-Key Cryptosystems Built Using Polynomial Rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 219 LNCS, pp. 73–78). Springer Verlag. https://doi.org/10.1007/3-540-39805-8_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free