学术报告

当前位置:学术交流 >> 学术报告 >> 浏览文章

学术报告:Approximate Polynomial Common Divisor Problem Relates to Noisy Multipolynomial Reconstruction

发布时间:2017年06月28日 浏览次数:发布者:mathky

报告人:许军助理研究员

        中科院信息工程研究所

报告题目:Approximate Polynomial Common Divisor Problem Relates to Noisy Multipolynomial Reconstruction

报告时间: 20177月03日上午10:00

报告地点:海韵实验楼105

内容摘要:In this paper, we investigate the hardness of the approximate polynomial common divisor problem, which is regarded as a polynomial analogy of the approximate integer common divisor problem. In order to solve this problem, we present a simple and rigorous method by using the polynomial lattice reduction algorithm and also present complete theoretical analysis. Further, we propose an improved lattice attack to reduce both space and time requirements. Moreover, these two attacking methods can be applied to solve the noisy multipolynomial reconstruction problem in the field of error-correcting codes. The obtained asymptotic result is close to the theoretical limit on solving the noisy multipolynomial reconstruction problem. We also see that our improved lattice attack performs faster that the known methods. In addition, the input basis matrix in our improved lattice attack only utilizes some most significant coefficients of given samples, which may be of independent interest.

报告人简介:许军于2011年考取中国科学院信息工程研究所信息安全专业的博士,具体研究方向为基于格的公钥密码分析以及相关计算困难问题的难度评估,先后获得了2012年度信息工程研究所所长优秀奖以及2014年度中国科学院院长优秀奖。2014年7月博士毕业后由安徽大学调入中国科学院信息工程研究所工作。入选2015年度中国科学院信息工程研究所“引进优秀青年人才计划”。目前主持一项国家自然科学青年基金“几类密码方案的格分析优化技术”。在国际学术期刊Designs, Codes and Cryptography 、IET Communications以及国际主流信息安全会议ISC、ICICS等共发表18篇研究论文。

学院联系人:曾吉文教授、祝辉林副教授、李伟助理教授

 

欢迎广大师生参加!