Example: air traffic controller
The Learning with Errors Problem - NYU Courant

The Learning with Errors Problem - NYU Courant

Back to document page

hardness is based on slightly less standard (but still quite believable) assumptions. Namely, ei-ther that GAPSVP is hard to approximate even given a ‘hint’ in the form of a short basis, or that GAPSVP or SIVP are hard to approximate to within polynomial factors even with a quantum computer. We note that SIVP is in some sense harder than GAPSVP, and the fact that we …

  With, Learning, Errors, Learning with errors

Download The Learning with Errors Problem - NYU Courant


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries