* @brief Release the seed expander context * @param[in] state Internal state of the seed expander */

* @brief Adds two vectors * * @param[out] o Pointer to an array that is the result * @param[in] v1 Pointer to an array that is the first vector *

* @brief Initialise a SHAKE-256 based seed expander * * Derived from function SHAKE_256 in fips202.c * * @param[out] state Keccak internal state a

* @brief Release the seed expander context * @param[in] state Internal state of the seed expander */

* @brief Adds two vectors * * @param[out] o Pointer to an array that is the result * @param[in] v1 Pointer to an array that is the first vector *

* Name: PQCLEAN_MLDSA44_AVX2_poly_add * * Description: Add polynomials. No modular reduction is performed. * * Arguments: - poly *c: pointer

* Name: PQCLEAN_MLDSA44_AVX2_poly_chknorm * * Description: Check infinity norm of polynomial against given bound. * Assumes input

* Name: PQCLEAN_MLDSA44_CLEAN_polyveck_invntt_tomont * * Description: Inverse NTT and multiplication by 2^{32} of polynomials * in

* Name: PQCLEAN_MLDSA44_CLEAN_polyveck_reduce * * Description: Reduce coefficients of polynomials in vector of length K * to repre

* Name: PQCLEAN_MLDSA65_AVX2_poly_add * * Description: Add polynomials. No modular reduction is performed. * * Arguments: - poly *c: pointer

* Name: PQCLEAN_MLDSA65_AVX2_poly_chknorm * * Description: Check infinity norm of polynomial against given bound. * Assumes input

* Name: PQCLEAN_MLDSA65_CLEAN_polyveck_invntt_tomont * * Description: Inverse NTT and multiplication by 2^{32} of polynomials * in

* Name: PQCLEAN_MLDSA65_CLEAN_polyveck_reduce * * Description: Reduce coefficients of polynomials in vector of length K * to repre

* Name: PQCLEAN_MLDSA87_AVX2_poly_add * * Description: Add polynomials. No modular reduction is performed. * * Arguments: - poly *c: pointer

* Name: PQCLEAN_MLDSA87_AVX2_poly_chknorm * * Description: Check infinity norm of polynomial against given bound. * Assumes input

* Name: PQCLEAN_MLDSA87_CLEAN_polyveck_invntt_tomont * * Description: Inverse NTT and multiplication by 2^{32} of polynomials * in

* Name: PQCLEAN_MLDSA87_CLEAN_polyveck_reduce * * Description: Reduce coefficients of polynomials in vector of length K * to repre

buf 32 bytes longer for cbd3 */

* Name: PQCLEAN_MLKEM1024_CLEAN_poly_reduce * * Description: Applies Barrett reduction to all coefficients of a polynomial * for d

* Name: PQCLEAN_MLKEM512_CLEAN_poly_reduce * * Description: Applies Barrett reduction to all coefficients of a polynomial * for de

buf 32 bytes longer for cbd3 */

* Name: PQCLEAN_MLKEM768_CLEAN_poly_reduce * * Description: Applies Barrett reduction to all coefficients of a polynomial * for de

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

* Copy the layer and tree fields of the address structure. This is used * when we're doing multiple types of hashes within the same Merkle tree */

field multiplication */

field multiplication */

* Name: keccak_absorb * * Description: Absorb step of Keccak; * non-incremental, starts by zeroeing the state. * * Arguments:

* Name: keccak_inc_absorb * * Description: Incremental keccak absorb * Preceded by keccak_inc_init, succeeded by keccak_inc_fin

* Name: keccak_inc_finalize * * Description: Finalizes Keccak absorb phase, prepares for squeezing * * Arguments: - uint64_t *s_inc: poin

* Name: keccak_inc_init * * Description: Initializes the incremental Keccak state to zero. * * Arguments: - uint64_t *s_inc: pointer to i

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Compute 2^(31*x) modulo p. This works for integers x up to 2^11. * p must be prime such that 2^30 < p < 2^31; p0i must be equal to * -1/p mod 2^31

* Reduce a small signed integer modulo q. The source integer MUST * be between -q/2 and +q/2. */

* Reduce a small signed integer modulo q. The source integer MUST * be between -q/2 and +q/2. */

* Reduce a small signed integer modulo q. The source integer MUST * be between -q/2 and +q/2. */

* Reduce a small signed integer modulo q. The source integer MUST * be between -q/2 and +q/2. */