Cryptology ePrint Archive: Report 2011/119

Multiplicative Learning with Errors and Cryptosystems

Gu Chunsheng

Abstract: We introduce a new concept, called multiplicative learning with errors (MLWE), which is a corresponding multiplicative version of the additive learning with errors (LWE), and show the equivalence between the decisional version and the search version for MLWE such that p is a product of sufficiently large smoothing prime factors. Then we construct the MLWE-based private-key and public-key encryption schemes, whose securities are based on the worst-case hardness assumption of the MLWE problem. Finally, we discuss how to extend the LWE on additive group to the LWE on general abelian group.

Category / Keywords: public-key cryptography / Multiplicative Learning with Errors, Private-Key Encryption, Public-key Encryption, LWE on Abelian Group

Date: received 9 Mar 2011, withdrawn 21 Mar 2014

Contact author: guchunsheng at gmail com

Available format(s): (-- withdrawn --)

Version: 20140322:020802 (All versions of this report)

Short URL: ia.cr/2011/119

Discussion forum: Show discussion | Start new discussion