报告题目: Lattice reduction and Integer relation detection

报告人: 陈经纬副研究员

报告时间: 2019年12月28日15:50-16:20

摘要: In this talk, we will focus on the integer relation detection problem, for which there exist two commonly used polynomial time algorithms. The one is the PSLQ algorithm that was named as one of top 10 algorithms in the 20th century, and the other is the lattice-reduction-based algorithm which is carefully investigated in recent years. We will review these two kinds of integer relation algorithms and also report some experimental results with several software packages.

陈经纬副研究员简历: 陈经纬,中国科学院重庆绿色智能技术研究院副研究员, 2012年1月至12月,作为中法联合培养博士生,在法国ENS de Lyon(里昂高师)LIP实验室学习,2013年从中国科学院成都计算所获博士学位,先后入选中科院“西部之光”计划和中科院青年创新促进会,主要从事格的理论、算法及应用方面的研究。

(十二)

报告题目: 基于格问题LWR的同态加密方案设计


陈经纬 可能工作过的组织/机构/部门/团队:


陈经纬 可能工作过的同事:

粤ICP备17091748号-3
剧本杀复盘 剧本杀复盘 红酒 ChatGPT
传奇私服 阿斗复盘 邰谇是 剧本杀《达芬奇》复盘解析 mn你住在讶我心里