p3-mds 0.5.3

A collection of methods allowing for fast multiplication by MDS matrices.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28

//! Maximum distance separable (MDS) matrix multiplication.
//!
//! MDS matrices provide optimal diffusion for algebraic hash functions.
//! Any k x k submatrix is invertible, so the associated linear code
//! achieves the Singleton bound.
//!
//! Three strategies are provided:
//! - Reed-Solomon coset evaluation via Bowers butterfly networks.
//! - An optimized variant that integrates coset shifts into twiddle factors.
//! - Karatsuba-style convolution for circulant matrices.

#![no_std]

extern crate alloc;

use p3_symmetric::Permutation;

mod butterflies;
pub mod coset_mds;
pub mod integrated_coset_mds;
pub mod karatsuba_convolution;
pub mod util;

/// Marker trait for permutations that are MDS.
///
/// An MDS permutation guarantees that any square submatrix of the
/// underlying linear map is invertible.
pub trait MdsPermutation<T: Clone, const WIDTH: usize>: Permutation<[T; WIDTH]> {}