题目：Algorithms for polynomial selection in the number field sieve 

时间：2015年12月25日下午2:00~3:00 

地点：信工所3号楼3224会议室 

报告人：Dr Shi Bai (白石) 

内容摘要：The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being the polynomial selection. The running-time of the number field sieve depends on the quality of the chosen polynomials. The quality of the chosen polynomials can be modeled in terms of size and root properties. In this talk, we will describe some better algorithms to select polynomials with good size and root properties. 

报告人简介：Dr Shi Bai is a postdoctoral research fellow at Ecole Normale Superieure Lyon. His research interests are in cryptography and computational number theory. He received his B.S. degree from China University of Mining and Technology (Beijing)  then obtained M.S and Ph.D. degrees in Computer Science under the supervision of Richard Brent from the Australian National University. He was a postdoctoral research fellow at the University of Auckland from 2013-2014. He is currently interested in number theoretical algorithms in cryptography/cryptanalysis such as algorithms for lattice-based cryptography and algorithms for integer factorization. He is a developer of the open-source software CADO-NFS for integer factorization and FPLLL for lattice reduction. He is a recipient of the best paper award in Asiacrypt 2015.