RustCrypto: Double operation in GF(2^n)
Double operation (a.k.a. "multiply-by-x") in Galois Field GF(2^n) using
the lexicographically first polynomial among the irreducible degree n polynomials
having a minimum number of coefficients.
Licensed under either of:
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.