Example: air traffic controller
Search results with tag "Learning with errors"
On Lattices, Learning with Errors, Random Linear Codes ...
cims.nyu.eduOn Lattices, Learning with Errors, Random Linear Codes, and Cryptography Oded Regev ⁄ May 2, 2009 Abstract Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning from parity with error’ problem to higher moduli.
The Learning with Errors Problem - NYU Courant
cims.nyu.eduhence do not apply to LPN, i.e., the case q = 2. Finally, we remark that the approximation factors obtained for the worst-case lattice problems are typically of the form O˜(n/a), explaining why we prefer to have a 1/poly(n). A further discussion of the known hardness results will be given in …