Greetings!
Just in time before the next release I finished my revision of the first
part
of the Galois Fields package. Today I uploaded functions and tests.
I plan to revise the documentation in autumn this year.
For the interested who wants to see the new functions in action I attached
a
working example on AES en/decryption.
In short, what has changed and what is new:
- improved algorithms: logarithm, primitive element, order of field element
- new algorithms: test of irreducibility, order of quotient ring
- improved timings: tests run 5 - 50 times faster
(e.g. primitive elements: 5 - 10, logarithms: 30 - 50)
- improved usability:
* gf_add, gf_mul, ... gf_matadd, gf_matmul are now N-ary functions
* functions now return polynomials with exclusively positive coefficients
* knowledge of irreducible polynomial not necessary to set a field
* reduction polynomial not necessarily irreducible
* option variable controls return type: general form or CRE
I'd like to especially thank Camm Maguire who helped me with optimizations
for GCL.
Take care.
Volker van Nek
-------------- next part --------------
A non-text attachment was scrubbed...
Name: aes.mac
Type: application/octet-stream
Size: 6651 bytes
Desc: not available
URL: <http://www.math.utexas.edu/pipermail/maxima/attachments/20120802/e24f36ae/attachment-0001.obj>;