Public Key Cryptosystems from the Multiplicative Learning with Errors

摘要：

We construct two public key cryptosystems based on the multiplicative learning with errors (MLWE) problem. The cryptosystem 1 (resp. 2) are semantically secure assuming the worst-case hardness of the decisional composite residuosity problem and the search (resp. decisional) LWE problem, which implies approximating the shortest vector problem in a lattice to small polynomial factors. Namely, our cryptosystems are secure as long as one of them is hard. Moreover, the cryptosystem 1 can be adapted to the chosen ciphertext secure cryptosystem. In addition, the cryptosystem 2 has the additively homomorphic property.

关键词： Multiplicative Learning with Errors Public-key Cryptography Lattice-based Cryptography Decisional Composite Residuosity Assumption Factoring Integer

作者: Gu Chunsheng

作者单位: School of Computer Engineering Jiangsu Teachers University of Technology Changzhou, China, 213001

会议类型: 国际会议

会议名称: 2010年IEEE多媒体信息网络与安全国际会议

会议地点: 南京

会议语种:英文

页码: 456-459

在线出版日期: 2010-11-01（万方平台首次上网日期，不代表论文的发表时间）