Thời gian: 14h, Thứ tư ngày 27 tháng 7 năm 2016
Địa điểm: Phòng 201, Nhà A5, Viện Toán học, 18 Hoàng Quốc Việt.
Tóm tắt: 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.