Summation polynomials and the elliptic curve discrete logarithm problem
Title: Summation polynomials and the elliptic curve discrete logarithm problem
Speaker: Daniela Mueller (UCD)
Date: Monday, 2nd November 2015
Time: 4pm – 5pm
Location: Agriculture. 1.01 (Seminar Room).
Abstract:
This talk presents ways of using summation polynomials introduced by Semaev in 2004 to develop an index calculus type algorithm to solve the elliptic curve discrete logarithm problem (ECDLP). I first explain what the ECDLP is and some currently known approaches that exploit field extensions, but then focus on ideas of how to adapt these techniques to elliptic curves defined over prime order fields.
Series: Algebra
Social Media Links