Lattice Based Cryptography

On Lattices, Learning with Errors, Random Linear Codes ...

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.

  With, Learning, Errors, Cryptography, Lattice, Learning with errors