报告题目: Discrete Logarithms in Small Characteristic
报告人: Daqing Wan 教授
主持人：曹珍富 教授
报告时间：2014年10月31日 10:00
报告地点：中北校区数学馆201
主办单位：上海市高可信计算重点实验室
报告摘要:
The discrete logarithm problem is one of the most important problems in cryptography. In this talk, I will explain the mathematical ideas and questions arising from the recent breakthrough BGJT algorithm for discrete logarithms over finite fields of small characteristic. This is joint work with Q. Cheng and J. Zhuang (ANTS 2014).
报告人简介：
Daqing Wan is a Professor in the department of Mathematics, University of California, Irvine. His research interests are primarily in the areas of number theory, arithmetic geometry, coding theory, and cryptography. He received his Ph.D. from the University of Washington in Seattle in 1991. His research has been published in top tier mathematical journals and conferences such as Annals of Mathematics, Inventiones Mathematicae, Journal of the American Mathematical Society and top tier computer science journals and conferences such as IEEE Symposium on Foundations of Computer Science (FOCS), ACM Symposium on Theory of Computing (STOC), IEEE Transactions on Information Theory. His titles include but not limited to Simons Fellowship of the United States， He has done a great job in solving algorithms, coding theory, and computer science problems by using number theory techniques during the past few years.