Speaker

郁昱 教授

Affiliation

上海交通大学

Time

2019-06-21 (Fri) 10:00

Location

上海研究院4号楼329报告厅（理化大楼一楼科技展厅同步视频）

Abstract

Learning Parity with Noise (LPN) is a notoriously (quantum) hard problem in learning theory and coding theory. It represents the well-known NPC problem "decoding random linear codes" and its average-case hardness is also well studied. Recently, there has been renewed interest in building provably secure crypto-systems from LPN. This talk will introduce the LPN problem and how to build postquantum public-key encryption schemes from the hardness of LPN.