报告题目：Solving the Decision Principal Ideal Problem with Pre-processing

报告人：庄金成教授

时间：2025年6月5日10：00-12：00

地点：文理楼290报告厅

报告摘要：The principal ideal problem constitutes a fundamental problem in algebraic number theory and has attracted significant attention due to its applications in ideal lattice based cryptosystems. Efficient quantum algorithm has been found to address this problem. The situation is different in the classical computational setting. In this talk, we delve into the relationship between the principal ideal problem and the class field computation. We show that the decision version of the problem can be solved efficiently if the class group is smooth, after precomputation has been completed to collect information about the Hilbert class field.

报告人简介：庄金成，山东大学网络空间安全学院教授，博士生导师。主要研究方向为后量子密码学、算法数论、编码学。研究成果发表在ANTS, IEEE TIT, DCC, TCS, 中国科学数学等会议和期刊，主持国家重点研发计划青年科学家项目。参与编写《公钥密码学的数学基础（第二版）》和《密码学概论》，主讲山东省一流课程“公钥密码学数学基础”，获山东大学青年教师教学比赛一等奖，指导员工竞赛获全国密码技术竞赛一等奖，全国老员工信息安全竞赛作品赛一等奖。