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.
Chapter PDF
Similar content being viewed by others
5. Bibiography
Berlekamp E.R., Algebraic Coding Theory, McGraw-Hill Book Company, New York, 1968
Denning D.E., Cryptography and Data Security, Addison-Wesley Publishing Company, Reading, Massachusetts, 1982
Brickell E.F., Attacks on Generalized Knapsack Schemes, EUROCRYPT 85, Linz, Austria, 1985
Merkle R.C., Hellman M.E., Hiding Information and Signatures in Trapdoor Knapsack, IEEE Trans. on Inf. Theory, Vol. IT-24, September 1978, pp.525–530.
Pieprzyk J.P., Rutkowski D.A., Design of Public-Key Cryptosystems Using Idempotent Elements, Proc. of EUROCON, Brighton, UK, 26–28 September, 1984, pp.64–8
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pieprzyk, J.P. (1986). On Public-Key Cryptosystems Built Using Polynomial Rings. In: Pichler, F. (eds) Advances in Cryptology — EUROCRYPT’ 85. EUROCRYPT 1985. Lecture Notes in Computer Science, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39805-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-39805-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16468-5
Online ISBN: 978-3-540-39805-9
eBook Packages: Springer Book Archive