{"id":486486,"date":"2018-05-16T16:02:54","date_gmt":"2018-05-16T23:02:54","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-research-item&p=486486"},"modified":"2018-10-16T22:26:11","modified_gmt":"2018-10-17T05:26:11","slug":"high-precision-arithmetic-homomorphic-encryption","status":"publish","type":"msr-research-item","link":"https:\/\/www.microsoft.com\/en-us\/research\/publication\/high-precision-arithmetic-homomorphic-encryption\/","title":{"rendered":"High-Precision Arithmetic in Homomorphic Encryption"},"content":{"rendered":"
In most RLWE-based homomorphic encryption schemes the native plaintext elements are polynomials in a ring\u00a0Z<\/span><\/span><\/span>t<\/span><\/span>[<\/span>x<\/span>]<\/span>\/<\/span><\/span><\/span>(<\/span>x<\/span>n<\/span><\/span>+<\/span>1<\/span>)<\/span><\/span><\/span><\/span><\/span><\/p>\n