Provably Weak Instances of Ring-LWE

DOI10.1007/978-3-662-47989-6_4zbMath1336.94046arXiv1502.03708OpenAlexW1820018505MaRDI QIDQ3457105

Yara Elias, Ekin Ozman, Katherine E. Stange, Kristin E. Lauter

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.03708

zbMATH Keywords

polynomial learning with errors problems (Poly-LWE)ring learning with errors problems (Ring-LWE)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

Homomorphic Encryption Standard ⋮ Error analysis of weak poly-LWE instances ⋮ Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography ⋮ On the ring-LWE and polynomial-LWE problems ⋮ The polynomial learning with errors problem and the smearing condition ⋮ Security considerations for Galois non-dual RLWE families ⋮ Attacks on the Search RLWE Problem with Small Errors ⋮ The lattice-based digital signature scheme qTESLA ⋮ LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE ⋮ Integer Version of Ring-LWE and Its Applications ⋮ How (Not) to Instantiate Ring-LWE ⋮ LWE from non-commutative group rings ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Algebraic Aspects of Solving Ring-LWE, Including Ring-Based Improvements in the Blum--Kalai--Wasserman Algorithm ⋮ Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency ⋮ Rounding in the rings

Cites Work

• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• A construction of polynomials with squarefree discriminants
• Fully Homomorphic Encryption with Polylog Overhead
• Ring-LWE in Polynomial Rings
• Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Better Key Sizes (and Attacks) for LWE-Based Encryption
• Smooth analysis of the condition number and the least singular value
• On Ideal Lattices and Learning with Errors over Rings
• Lattice-based Cryptography
• On the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
• ML Confidential: Machine Learning on Encrypted Data
• A Toolkit for Ring-LWE Cryptography
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Provably Weak Instances of Ring-LWE