A public cryptosystem from R-LWE

Author

Wei, Ping ; Wu, Liqiang ; Yang, Xiaoyuan ; Hao, Bin

Author_Institution

Key Lab. of Network & Inf. Security of APF, Eng. Coll. of APF, Xi´´an, China

fYear

2011

fDate

27-29 May 2011

Firstpage

508

Lastpage

513

Abstract

Recently Vadim Lyubashevsky etc. built LWE problem on ring and proposed a public cryptosystem based on R-LWE, which, to a certain extent, solved the defect of large public key of this kind, but it didn´t offer parameter selections and performance analysis in detail. In this paper an improved scheme is proposed by sharing a ring polynomial vector that makes public key as small as 1/m of the original scheme in multi-user environments. In additions, we introduce a parameter r to control both the private key space size and decryption errors probability, which greatly enhances the flexibly and practicality. The correctness, security and efficiency are analyzed in detail and choice of parameters is studied, at last concrete parameters are recommended for the new scheme.

Keywords

probability; public key cryptography; R-LWE; Vadim Lyubashevsky; decryption errors probability; parameter selections; performance analysis; private key; public cryptosystem; ring polynomial vector; Encryption; Lattices; Noise; Polynomials; Public key; Hard problem based on lattice; Parameters selection; Public Cryptosystem; R-LWE;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Conference_Location

Xi´an

Print_ISBN

978-1-61284-485-5

Type

conf

DOI

10.1109/ICCSN.2011.6013644

Filename

6013644