Multiplicative Learning With Errors and Cryptosystems

The authors 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 they 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, they discuss how to extend the LWE on additive group to the LWE on general abelian group.

Provided by: Jiangsu Teachers University of Technology Topic: Security Date Added: Mar 2011 Format: PDF

Find By Topic