Cryptology ePrint Archive: Report 2014/506
Available versions in chronological order
20140626:212416 (posted 26-Jun-2014 21:24:16 UTC)
Finding Roots in GF(p^n) with the Successive Resultant Algorithm
Christophe Petit
Original publication (in the same form): To appear in the LMS Journal of Computation and Mathematics, as a special issue for ANTS (Algorithmic Number Theory Symposium) conference.
[
Cryptology ePrint archive
]