学术报告
The Discrete Logarithms and the Algorithms - Prof. Qi Cheng （Professor of Computer Science, University of Oklahoma）
作者：
时间： 2016-06-28
阅读：
题 目：The Discrete Logarithms and the Algorithms
报告人：Prof. Qi Cheng （Professor of Computer Science, University of Oklahoma）
摘要：
Many cryptography protocols rely on hard computational number theoretical problems for security. The discrete logarithm problem over finite fields or elliptic curves is one of the most important candidates, besides the integer factorization problem. In this talk, I will survey several algorithms attacking the discrete logarithms over finite fields.
My discussion will be focusing on the quasi-polynomial-time algorithm that solves the discrete logarithm in small characteristic fields.
时间：6月28日（周二）下午4:00--5:00
地点：首都师范大学北二区教学楼509教室
欢迎全体师生积极参加！
