当前位置:首页  教学科研

学术讲座【Proving security of lattices using algebraic and analytic number theory】

时间:2017-12-18浏览:400设置

时间:2017年12月19日(星期二)10:35-11:50

地点:旗山校区理工北楼601报告厅

主办:数学与信息学院、福建省网络安全与密码技术重点实验室

主讲:Fuchun Lin

专家简介:Fuchun Lin received the Ph.D from Nanyang Technological University, Singapore in 2014, he was  a post doctoral fellow at University of Calgary, Canada from 2015 to 2016. He is currently an assistant researcher at Nanyang Technological University, Singapore.His research interest includes coding and cryptography and his main focus is on information-theoretic security. His PhD thesis is on lattice coding for Gaussian wiretap channel. After PhD he worked on general wiretap channel coding and adversarial wiretap channel coding. Other than coding for leakage resiliency, he also worked on coding for tamper resiliency, tamper detection codes and non-malleable codes.

报告摘要:One of the reasons that lattices are becoming popular among cryptographers is because the security of cryptographic primitives constructed using lattices can be rigorously proved mathematically. In the information-theoretic security setting, the meaning of provable is the same as in mathematics. In the computational security setting, provable is in a weaker sense that assumes a few longstanding conjectures are true. The provable property of lattices comes from their rich structure that has been studied in algebraic and analytic number theory.


返回原图
/