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.
Supported by the Faculty Research Fund of Konkuk University in 2002 and NSRI.
Supported by NSRI.
Chapter PDF
Similar content being viewed by others
References
D. Coppersmith, A. Shamir Lattice Attacks on NTRU, Advances in Cryptology-Eurocrypt’ 97, LNCS 1233 (1997), 52–61
E. Fujisaki, T. Okamoto Secure Integration of Asymmetric and Symmetric Encryption Schemes, Advances in Cryptology-Crypto’ 99, LNCS 1666 (1999), 537–554 306
C. Gentry Key Recovery and Message Attacks on NTRU-Composite, Advances in Cryptology-Eurocrypt’ 01, LNCS 2045 (2001), 182–194
O. Goldreich, S. Goldwasser, S. Halevi Public Key Cryptosystems from Lattice Reduction Problems, Advances in Cryptology-Crypto’ 97, LNCS 1294 (1997), 112–131 292, 294
J. Hoffstein, J. Pipher, J. Silverman NTRU: a Ring Based Public Key Cryptosystem, ANTS III, LNCS 1423 (1998), 267–288 295
E. Jaumels, A. Joux A Chosen-Ciphertext Attack against NTRU, Advances in Cryptology-Crypto 2000, LNCS 1880 (2000), 20–35
R. Lidl, H. Niederreiter Introduction to Finite Fields and Their Applications, Cambridge University Press, (1986) 300
D. Micciancio Improving Lattice Based Cryptosystems Using the Hermite Normal Form, CaLC 2001, LNCS 2146 (2001), 126–145 292, 300, 305
P. Nguyen Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto’ 97, Advances in Cryptology-Crypto’ 99, LNCS 1666 (1999), 288–304 292, 293, 294, 299
C.P. Schnorr A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms, Theoretical Computer Science 53 (1987), 201–224 295, 300
L. C. Washington Introduction to Cyclotomic Fields, Springer-Verlag, GTM 83 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paeng, SH., Jung, B.E., Ha, KC. (2003). A Lattice Based Public Key Cryptosystem Using Polynomial Representations. In: Desmedt, Y.G. (eds) Public Key Cryptography — PKC 2003. PKC 2003. Lecture Notes in Computer Science, vol 2567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36288-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-36288-6_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00324-3
Online ISBN: 978-3-540-36288-3
eBook Packages: Springer Book Archive