galois_fields 2.1.0 (2026-10-14)
    * Faster element arithmetic (C core and gateways):
      - GF(2^n) multiplication, division, powers and element tables work on
        bit-packed words; inverses use the extended Euclidean algorithm.
      - Prime fields GF(p) multiply directly and invert with the extended
        Euclidean algorithm instead of Fermat exponentiation.
      - Other extension fields use log/antilog tables, cached for the last
        field used by gf_multiply, gf_divide and gf_power.
      - Reduction no longer recomputes the inverse of the leading coefficient
        for monic polynomials.
      - gf_minimal_polynomial no longer builds the whole power table.
      - Division in other extension fields without cached tables inverts
        with the extended Euclidean algorithm on polynomials.
    * Added Spanish (es_ES) help pages.
 -- Daniel E Rodriguez (UIS)

galois_fields 2.0.0 (2026-10-10)
    * Ported to Scilab 6.1+ (tested with 2024.0.0): Scilab 6 C gateway API
      ("csci6"), current toolbox skeleton builder/loader/cleaner scripts.
    * Rewrote the C core library (src/c).
    * Invalid arguments now raise Scilab errors; functions no longer print
      informational text.
    * gf_create_field picks a default primitive polynomial for any degree n.
    * gf_is_primitive_polynomial and gf_is_prime return booleans.
    * Element operations work on several elements at once.
    * Polynomial addition/subtraction accept operands of different lengths.
    * Removed the p <= 107 limit of the primitive elements computation.
    * Fixed: a^(q-1) now returns 1 for non-zero a.
    * Rewrote the Hamming (7,4) demo (non-interactive) and added a GF(2^4)
      arithmetic demo.
    * Added unit tests (tests/unit_tests).
    * Added help pages for every function, an overview page, and the help
      build.
 -- Daniel E Rodriguez (UIS)

galois_fields 1.0
    * Original release.
 -- Daniel E Rodriguez (UIS)
