Abstract
In Crypto 97, a public key cryptosystem based on the closest vector problem was suggested by Goldreich, Goldwasser and Halevi [4]. In this paper, we propose a public key cryptosystem applying representations of polynomials to the GGH encryption scheme. Its key size is much smaller than the GGH system so that it is a quite practical and efficient lattice based cryptosystem. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Paeng, S. H., Jung, B. E., & Ha, K. C. (2003). A lattice based public key cryptosystem using polynomial representations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2567, 292–308. https://doi.org/10.1007/3-540-36288-6_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
