Order-LWE and the hardness of ring-LWE with entropic secrets

DOI10.1007/978-3-030-34621-8_4MaRDI QIDQ2176642zbMATH OpenOpenAlexFDO

Authors Madalina Bolboceanu, Zvika Brakerski, Renen Perlman, Devika Sharma

Publication date 5 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-34621-8_4

zbMATH Keywords

ring-LWElattice problemsentropic secrets

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Lossiness and entropic hardness for ring-LWE
• Hardness of LWE on general entropic distributions
• How (not) to instantiate ring-LWE
• On ideal lattices and learning with errors over rings
• Learning with errors over rings. (Abstract)

Cited in

(13)

• LWE with side information: attacks and concrete security estimation
• Hardness of LWE on general entropic distributions
• Algebraically structured LWE. Revisited
• Algebraically structured LWE, revisited
• Entropic hardness of Module-LWE from module-NTRU
• Towards a ring analogue of the leftover hash lemma
• Non-commutative ring learning with errors from cyclic algebras
• Lossiness and entropic hardness for ring-LWE
• On algebraic embedding for unstructured lattices
• (In)security of ring-LWE under partial key exposure
• Hardness of entropic module-LWE
• Rounding in the rings
• Fractional non-norm elements for division algebras, and an application to cyclic learning with errors

This page was built for publication: Order-LWE and the hardness of ring-LWE with entropic secrets

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