Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

A Lattice Based Public Key Cryptosystem Using Polynomial Representations

Seong-Hun PaengContact Information, Bae Eun JungContact Information and Kil-Chan HaContact Information

(5)  ETRI, 161 Kajong-dong, Yusong-gu, 305-350 Taejon, Korea
(6)  Department of Applied Mathematics, Sejong University, 143-747 Seoul, Korea
(7)  Department of Mathematics, Konkuk University, 143-701 Seoul, Korea
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.

Keywords  GGH cryptosystem - lattice based public key cryptosystem - polynomial representation

Supported by the Faculty Research Fund of Konkuk University in 2002 and NSRI.
Supported by NSRI.

Contact Information Seong-Hun Paeng
Email: shpaeng@konkuk.ac.kr

Contact Information Bae Eun Jung
Email: bejung@etri.re.kr

Contact Information Kil-Chan Ha
Email: kcha@sejong.ac.kr
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.106 • Server: MPWEB26
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)