Error analysis of weak poly-LWE instances

DOI10.1007/S12095-018-0301-XzbMATH Open1412.94162OpenAlexW2800569707WikidataQ129883034 ScholiaQ129883034MaRDI QIDQ2632837FDOQ2632837

Authors: Yao Chen, Benjamin M. Case, Shuhong Gao, Guang Gong 

Publication date: 15 May 2019

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-018-0301-x

Recommendations

• Provably weak instances of Ring-LWE
• Provably weak instances of ring-LWE revisited
• Revisiting the hardness of binary error LWE
• On error distributions in ring-based LWE
• How (not) to instantiate ring-LWE

zbMATH Keywords

weak instanceserror distributuionpoly-LWE

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• On ideal lattices and learning with errors over rings
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• On lattices, learning with errors, random linear codes, and cryptography
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography
• Improved security for a ring-based fully homomorphic encryption scheme
• How (not) to instantiate ring-LWE
• Weak instances of PLWE
• Provably weak instances of ring-LWE revisited
• Provably weak instances of Ring-LWE
• Attacks on the Search RLWE Problem with Small Errors

Cited In (2)

• The Influence of LWE/RLWE Parameters on the Stochastic Dependence of Decryption Failures
• The polynomial learning with errors problem and the smearing condition

This page was built for publication: Error analysis of weak poly-LWE instances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632837)