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

DOI10.1007/978-3-030-34621-8_4zbMath1455.94204OpenAlexW2990015051MaRDI QIDQ2176642

Madalina Bolboceanu, Renen Perlman, Zvika Brakerski, 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

lattice problemsring-LWEentropic secrets

Mathematics Subject Classification ID

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

Related Items

Non-commutative ring learning with errors from cyclic algebras ⋮ Algebraically structured LWE. Revisited ⋮ (In)security of ring-LWE under partial key exposure ⋮ Towards a ring analogue of the leftover hash lemma ⋮ Rounding in the rings ⋮ LWE with side information: attacks and concrete security estimation ⋮ Hardness of LWE on general entropic distributions