Time: 14h, Wednesday, July 27, 2016
Location: Room 201, Institute of Mathematics, 18 Hoang Quoc Viet.
Abstract:: The Learning with errors (LWE) is devised by Regev (2005) and has served as the modern foundation for public key encryption. This problem is a generalization of the learning parity with noise problem in Machine learning. The aim of this talk is to present the definition of LWE problem; proof the equivalence of 2 versions: search and decision; describe connection between worst case and average case; and consider some cryptosystems built from LWE.