A Public Cryptosystem from R-LWE
Recently Vadim Lyubashevsky etc. built LWE problem on ring and proposed a public cryptosystem based on RLWE, which, to a certain extent, solved the defect of large public key of this kind, but it didnt 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.
Public Cryptosystem R-LWE Hard problem based on lattice Parameters selection.
Ping Wei Liqiang Wu Xiaoyuan Yang Bin Hao
Key Laboratory of Network & Information Security of APF,Engineering College of APF, Xian 710086, Ch Key Laboratory of Network & Information Security of APF,Engineering College of APF, Xian 710086,Chi Key Laboratory of Computer Network & Information Security of the Ministry of Education, Xidian Unive Key Laboratory of Network & Information Security of APF, Engineering College of APF, Xian 710086, C
国际会议
西安
英文
508-513
2011-05-27（万方平台首次上网日期，不代表论文的发表时间）