2019-05-24 17:38:54 +01:00
|
|
|
#ifndef NIEDERREITER_H
|
|
|
|
#define NIEDERREITER_H
|
|
|
|
|
2019-05-19 18:14:46 +01:00
|
|
|
#include "gf2x_arith_mod_xPplusOne.h"
|
2019-05-27 19:17:53 +01:00
|
|
|
#include "gf2x_limbs.h"
|
|
|
|
#include "qc_ldpc_parameters.h"
|
2019-05-24 17:38:54 +01:00
|
|
|
#include "rng.h"
|
2019-05-19 18:14:46 +01:00
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
/* raw entropy extracted from TRNG, will be deterministically expanded into
|
|
|
|
* H and Q during decryption */
|
|
|
|
unsigned char prng_seed[TRNG_BYTE_LENGTH];
|
|
|
|
int8_t rejections;
|
|
|
|
} privateKeyNiederreiter_t;
|
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
DIGIT Mtr[(N0 - 1)*NUM_DIGITS_GF2X_ELEMENT];
|
|
|
|
// Dense representation of the matrix M=Ln0*L,
|
|
|
|
// An array including a sequence of (N0-1) gf2x elements;
|
|
|
|
// each gf2x element is stored as a binary polynomial(mod x^P+1)
|
|
|
|
// with P coefficients.
|
|
|
|
} publicKeyNiederreiter_t;
|
|
|
|
|
2019-05-24 17:38:54 +01:00
|
|
|
|
|
|
|
|
2019-05-27 19:17:53 +01:00
|
|
|
void PQCLEAN_LEDAKEMLT12_CLEAN_niederreiter_keygen(
|
|
|
|
publicKeyNiederreiter_t *pk,
|
|
|
|
privateKeyNiederreiter_t *sk,
|
|
|
|
AES_XOF_struct *keys_expander);
|
2019-05-24 17:38:54 +01:00
|
|
|
|
2019-05-27 19:17:53 +01:00
|
|
|
void PQCLEAN_LEDAKEMLT12_CLEAN_niederreiter_encrypt(
|
|
|
|
DIGIT syndrome[],
|
|
|
|
const publicKeyNiederreiter_t *pk,
|
|
|
|
const DIGIT *err);
|
2019-05-24 17:38:54 +01:00
|
|
|
|
|
|
|
// return 1 if everything is ok
|
2019-05-27 19:17:53 +01:00
|
|
|
int PQCLEAN_LEDAKEMLT12_CLEAN_niederreiter_decrypt(
|
|
|
|
DIGIT *err,
|
|
|
|
const privateKeyNiederreiter_t *sk,
|
|
|
|
const DIGIT *syndrome);
|
2019-05-24 17:38:54 +01:00
|
|
|
|
|
|
|
|
|
|
|
#endif
|