Weil descent, last fall degree and the elliptic curve discrete logarithm problem
报告人:
Ming-Deh Huang
University of Southern California
报告时间:
2015-07-28 14:00
报告地点:
高等研究院（科学馆）213报告厅
主办单位:
高等研究院
简介:
The elliptic curve discrete logarithm problem (ECDLP) is a computational problem that has many applications in cryptography. Its computational complexity is an interesting and important problem in its own right. After an overview of different approaches in the study of this problem we will focus our attention on the Weil descent approach. In this context we will discuss theoretical works on last fall degrees, which cast serious doubt on recent claims of heuristic subexponential Weil descent attacks on the ECDLP in finite fields of small characteristics.
