REVIEW 1 cited by
Classical Hardness of Learning with Errors
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems, even with polynomial modulus. Previously this was only known under quantum reductions. Our techniques capture the tradeoff between the dimension and the modulus of LWE instances, leading to a much better understanding of the landscape of the problem. The proof is inspired by techniques from several recent cryptographic constructions, most notably fully homomorphic encryption schemes.
Forward citations
Cited by 1 Pith paper
-
One Discrete Gaussian Sample in $2^{n/2+o(n)}$ Time
One discrete Gaussian sample at an arbitrary parameter can be drawn in 2^(n/2+o(n)) expected time, resolving an open question from ADRS15.
Discussion (0). Continue with ORCID to comment.