Subspace LWE
From MaRDI portal
Publication:2891505
DOI10.1007/978-3-642-28914-9_31zbMath1296.94136OpenAlexW2913985088MaRDI QIDQ2891505
Publication date: 15 June 2012
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_31
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Data encryption (aspects in computer science) (68P25)
Related Items (7)
Cryptography from Learning Parity with Noise ⋮ The Chaining Lemma and Its Application ⋮ Efficient authentication from hard learning problems ⋮ Solving the learning parity with noise's open question ⋮ Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ Worst-case to average-case reductions for module lattices
This page was built for publication: Subspace LWE
