Crate finitelib

source ·
Expand description

finitelib contains algorithms to work with finite fields.

Modules§

  • There are some common implementations for groups and fields over integer and float data types.
  • A module that contains a trait for mathematical field objects.
  • This module contains implementations of Galois fields such that prime field (GF(p)), splitting field (GF(p^m)), binary field (GF(2^m)).
  • A module that contains a trait for mathematical group objects.
  • This module implements operations over polynomials over a field.
  • Additional functions and algorithms.

Macros§

  • A macros that generates a Bigi data type calculating the size of the inner array from given number of bits that should be multiple of 64 (bit size of u64 unit).