105年校庆10年院庆暨南信息科技论坛

  题  目：Modern Methods and Recent Progress in Integer Factorization
内容简介：Integer Factorization is an old open mathematical problem for at least 2000 years since Euclid's times; Gauss justified it as “one of the most important and useful in all arithmetic” in his greatest single publication Disquisitiones Arithmeticae.With the advent of modern computers and Internet,  it also finds surprising  applications particularly in cryptography and Internet security. For example, the security of the most famous and widely used RSA pubic-key cryptosystem relies on the intractability of the Integer Factorization Problem (IFP). In this talk, starting from Gauss' factoring method described in his Disquisitiones Arithmeticae, I shall discuss some of the most important modern methods of factoring, including the currently fastest Number Field Sieve and the future quantum and biological factoring methods, and some of my own work/ideas in learnability and breakability of IFP and RSA.
报告人：英国Bedford大学计算机系、武汉大学计算机学院 颜松远 教授
时 间：2011年10月11日（周二）上午10：00
地 点：教学大楼A216室
 
热烈欢迎广大感兴趣的师生参加!
 
信息科学技术学院
2011年10月10日

作者：吉念宁