加入收藏夹
联系我们
关于本站
个人主页
西电导航
西安电子科技大学
    当前位置:首页>>学术讲座
Discrete logarithms in small characteristics
时间:2017-06-29 17:23    点击:   所属单位:通信工程学院
讲座名称 Discrete logarithms in small characteristics
讲座时间 2017-07-06 15:00:00
讲座地点 北校区新科技楼 1012会议室
讲座人 Prof. Daqing Wan
讲座人介绍 Prof. Wan received his Ph.D. from the University of Washington, Seattle in 1991, under the direction of Neal Koblitz (the independent co-creator of elliptic curve cryptography). Since 1997, he has been on the faculty of mathematics at the University of California at Irvine; he has also held visiting positions at the Institute for Advanced Study in Princeton, New Jersey, Pennsylvania State University, the University of Rennes, the Mathematical Sciences Research Institute in Berkeley, California, and the Chinese Academy of Sciences in Beijing.His primary interests include number theory and arithmetic algebraic geometry, particularly zeta functions over finite fields. He is known for his proof of Dwork's conjecture that the p-adic unit root zeta function attached to a family of varieties over a finite field of characteristic p is p-adic memrorphic. He received 2001Mornigside Silver Medal of Mathematics, ICCM II; 2002-2005 Oversea Distinguished Youth Grant, Ministry of Education, China; 2002-2005 One Hundred Talent Project , Chinese Academy of Sciences; 2010 Chancellor’s Award for Excellence in Undergraduate Research , UC Irvine; and 2014-2015 Simons Fellowship, USA.

讲座内容 The discrete logarithm problem (DLP) is a central problem in public key cryptography. During the last few years, a major breakthrough on DLP was made in small characteristics, which leads to a super-polynomial time algorithm. In this lecture, we will explain the main ideas behind these developments.
转载请注明出处:西安电子科技大学学术信息网
如果您有学术信息或学术动态,欢迎投稿。我们将在第一时间确认并收录,投稿邮箱: meeting@xidian.edu.cn
Copyright © 2011-2017 西安电子科技大学 
开发维护:电子工程学院网络信息中心  管理员:meeting@xidian.edu.cn 站长统计: