Subspace LWE

DOI10.1007/978-3-642-28914-9_31MaRDI QIDQ2891505zbMATH OpenOpenAlexFDO

Authors Krzysztof Pietrzak

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

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Cryptography with auxiliary input and trapdoor from constant-noise LPN
• Learning with errors over rings. (Abstract)
• On the concrete hardness of learning with errors
• On ideal lattices and learning with errors over rings
• An improved BKW algorithm for LWE with applications to cryptography and lattices

Cited in

(12)

• Efficient authentication from hard learning problems
• -subgaussian random variables in cryptography
• Worst-case to average-case reductions for module lattices
• Solving the learning parity with noise's open question
• Learning with errors in the exponent
• Cryptography from learning parity with noise
• The Chaining Lemma and its application
• Bi-homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
• LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
• TinyKeys: a new approach to efficient multi-party computation
• On the LWE cryptosystem with more general disturbance
• A systematic study of sparse LWE

This page was built for publication: Subspace LWE

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