报告题目：Hardness assumptions and algorithms in cryptography

　　报告时间：2019年5月10日(周五)15:00-16:00

　　报告地点：616会议室

　　报 告 人：美国弗罗里达大西洋大学 白石 博士 (Shi Bai, Florida Atlantic University)

　　邀 请 人：陈经纬 副研究员

　　报告摘要:

　　We will discuss the computational hardness assumptions underlying modern public-key cryptographic schemes. The two problems, integer factorization and lattice shortest vector problems, stand out as two popular hardness assumption in the pre and post-quantum era respectively. We will review some number theoretic algorithms for solving them, and in particular, compare the computational tasks in cryptanalyzing them. Furthermore, we will describe the concrete computational efforts for breaking relevant cryptographic challenges. In the end, we will describe some recent developments on algorithms for solving lattice problems.

　　报告人简介：

　　I have completed my PhD under the supervision of Prof. Richard Brent in the Algorithms & Data group at College of Engineering & Computer Science of the Australian National University. My PhD thesis is on Polynomial selection for the number field sieve. In 2012, I was an IT staff in the Mathematical Sciences Institute of ANU. In 2013-2014, I was a postdoctoral researcher at the University of Auckland, working with Prof. Steven Galbraith. In 2015-2016, I was a postdoctoral researcher at ENS Lyon, working with Prof. Damien Stehlé. In Fall 2016, I joined the Department of Mathematical Sciences at Florida Atlantic University. I am also a faculty member in the Center for Cryptology and Information Security (CCIS) http://www.science.fau.edu/cryptology/

　　欢迎大家到场聆听与交流!