Cryptology ePrint Archive: Report 2015/513

Available versions in chronological order

20150529:075412 (posted 29-May-2015 07:54:12 UTC): Computing Individual Discrete Logarithms Faster in $GF(p^n)$; Aurore Guillevic

[ Cryptology ePrint archive ]