学术报告
Refined Analysis to the Extended Tower Number Field Sieve-庄金成 教授（山东大学 网络空间安全学院）
编码密码学术活动月系列活动五
题目：Refined Analysis to the Extended Tower Number Field Sieve
报告人：庄金成 教授（山东大学 网络空间安全学院）
Abstract：
The hardness of discrete logarithm problem over finite fields is the security foundation of many cryptographic protocols. When the characteristic of the finite field is medium or large, the state-of-art algorithms for solving the corresponding problem are the number field sieve and its variants. In this talk, we will report a refined analysis to the extended tower number field sieve (exTNFS): including a uniform formula for the total complexity of the algorithm and a method to improve the computation in the smoothing phase by exploring subfield structures when the extension degree is composite.
时间：2020年10月20日（周二） 下午15:30-16:30
地点：线上腾讯会议（会议号：635 261 049）
联系人：张俊
主办单位：首都师范大学77779193永利官网
首都师范大学交叉科学研究院
