#finite-fields #polynomial #gf #galois #field #algorithm #galois-field

no-std g2poly

Primitive implementation of polynomials over the field GF(2)

6 releases (2 stable)

1.0.1 Jan 17, 2023
1.0.0 Jan 3, 2023
0.4.0 May 25, 2019
0.2.0 Apr 2, 2019
0.1.0 Dec 25, 2018

#421 in Algorithms

Download history 1145/week @ 2023-11-18 1059/week @ 2023-11-25 1094/week @ 2023-12-02 1194/week @ 2023-12-09 2067/week @ 2023-12-16 632/week @ 2023-12-23 1809/week @ 2023-12-30 1981/week @ 2024-01-06 3253/week @ 2024-01-13 1887/week @ 2024-01-20 2437/week @ 2024-01-27 1951/week @ 2024-02-03 1918/week @ 2024-02-10 2143/week @ 2024-02-17 20395/week @ 2024-02-24 24916/week @ 2024-03-02

49,702 downloads per month
Used in 27 crates (2 directly)

MIT/Apache

21KB
317 lines

g2poly

A small library to handle polynomials of degree < 64 over the finite field GF(2).

The main motivation for this library is generating finite fields of the form GF(2^p). Elements of GF(2^p) can be expressed as polynomials over GF(2) with degree < p. These finite fields are used in cryptographic algorithms as well as error detecting / correcting codes.

Documentation

Example

use g2poly;

let a = g2poly::G2Poly(0b10011);
assert_eq!(format!("{}", a), "G2Poly { x^4 + x + 1 }");
let b = g2poly::G2Poly(0b1);
assert_eq!(a + b, g2poly::G2Poly(0b10010));

// Since products could overflow in u64, the product is defined as a u128
assert_eq!(a * a, g2poly::G2PolyProd(0b100000101));

// This can be reduced using another polynomial
let s = a * a % g2poly::G2Poly(0b1000000);
assert_eq!(s, g2poly::G2Poly(0b101));

License

// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your // option. This file may not be copied, modified, or distributed // except according to those terms.

No runtime deps