You are looking at a specific version 20101103:185225 of this paper.
See the latest version.
Paper 2010/558
Solving LWE problem with bounded errors in polynomial time
Jintai Ding
Abstract
In this paper, we present a new algorithm, such that, for the learning with errors (LWE) problems, if the errors are bounded -- the errors do not span the whole prime finite field $F_q$ but a fixed known subset of size $D$ ($D<q$), which we call the learning with bounded errors (LWBE) problems, we can solve it with complexity $O(n^D)$.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- LWELatticebounded errorsmultivariate polynomialslinerization
- Contact author(s)
- jintai ding @ gmail com
- History
- 2010-11-03: received
- Short URL
- https://ia.cr/2010/558
- License
-
CC BY