Error analysis of weak poly-LWE instances

DOI10.1007/s12095-018-0301-xzbMath1412.94162OpenAlexW2800569707WikidataQ129883034 ScholiaQ129883034MaRDI QIDQ2632837

Shuhong Gao, Yao Chen, Benjamin M. Case, 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

zbMATH Keywords

weak instanceserror distributuionpoly-LWE

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

The polynomial learning with errors problem and the smearing condition

Cites Work

• Weak Instances of PLWE
• Provably Weak Instances of Ring-LWE Revisited
• How (Not) to Instantiate Ring-LWE
• Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
• Provably Weak Instances of Ring-LWE
• On Ideal Lattices and Learning with Errors over Rings
• Attacks on the Search RLWE Problem with Small Errors
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography
• On lattices, learning with errors, random linear codes, and cryptography

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