Cryptology ePrint Archive: Report 2014/924
Available versions in chronological order
20141111:123350 (posted 11-Nov-2014 12:33:50 UTC)
Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields
Antoine Joux and Cécile Pierrot
Original publication (in the same form): IACR-ASIACRYPT-2014
[
Cryptology ePrint archive
]