p3-poseidon2 0.5.0

An implementation of the Poseidon2 cryptographic permutation for zero-knowledge applications.
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42

//! Whilst high speed implementations of Poseidon2 rely on a detailed understanding of the underlying field structure
//! it is also useful to have a generic constructor which works for a much larger range of rings.
//!
//! Indeed, for a fixed field F, the Poseidon2 permutation consists of three basic operations:
//! - Addition by elements in F.
//! - A power map x -> x^n.
//! - Multiplication by an F valued matrix.
//!
//! This means that it is possible to define a Poseidon2 over any ring implementing `Algebra<F>`.
//!
//! This file implements the generic methods from which Poseidon2 can be built.

use p3_field::{Algebra, Field, InjectiveMonomial, PrimeCharacteristicRing};

use crate::{MDSMat4, mds_light_permutation};

/// A generic method performing the transformation:
///
/// `s -> (s + rc)^D`
///
/// This is a little slower than field specific implementations (particularly for packed fields) so should
/// only be used in non performance critical places.
#[inline(always)]
pub fn add_rc_and_sbox_generic<F: Field, A: Algebra<F> + InjectiveMonomial<D>, const D: u64>(
    val: &mut A,
    rc: F,
) {
    *val += rc;
    *val = val.injective_exp_n();
}

pub trait GenericPoseidon2LinearLayers<const WIDTH: usize>: Sync {
    /// A generic implementation of the matrix multiplication
    /// corresponding to the internal linear layer.
    fn internal_linear_layer<R: PrimeCharacteristicRing>(state: &mut [R; WIDTH]);

    /// A generic implementation of the matrix multiplication
    /// corresponding to the external linear layer.
    fn external_linear_layer<R: PrimeCharacteristicRing>(state: &mut [R; WIDTH]) {
        mds_light_permutation(state, &MDSMat4);
    }
}