Cryptology ePrint Archive: Report 2013/596
Available versions in chronological order
20130914:224740 (posted 14-Sep-2013 22:47:40 UTC)
Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods -- an Experimental Study
Michael Shantz and Edlyn Teske
Original publication (with minor differences): This paper appears in the Festschrift on the occasion of Johannes Buchmann's 60th birthday. The final publication is available at link.springer.com, LNCS vol. 8260.
Cryptology ePrint archive