A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Algebraic algorithms in GF(q)
1985
Discrete Mathematics
This talk reports on joint work with R. Loos (Univ. Karlsruhe) on algebraic algorithms for computing in large Galois Fields GF(q) with q = p" where p is the characteristic of the field and may be arbitrarily large. This work is materialized by a module of algorithms implemented in the ALDES/SACZ computer algebra system, which will be available with the next release of this system.
doi:10.1016/0012-365x(85)90017-2
fatcat:cwm6z3l5h5hfxglqxitvdwzq5u