Attack on the Polynomial Learning with Errors problem

Abstract: 

The Polynomial Learning with Errors problem (PLWE) is a promising contender for lattice based, post quantum cryptography, with applications revolving around the security and implementation of Public Key Encryption schemes, and Fully Homomorphic Encryption schemes.  This talk will cover an introduction to the PLWE problem, including parameter choices and the underlying ring structure. We will then review specific choices that expose the PLWE to attacks, as well as hardness reductions that exist, relating the difficulty of PLWE to other known difficult problems.