mirror of
https://github.com/henrydcase/pqc.git
synced 2024-11-27 18:01:34 +00:00
59 lines
2.1 KiB
C
59 lines
2.1 KiB
C
/**
|
|
*
|
|
* <niederreiter.h>
|
|
*
|
|
* @version 2.0 (March 2019)
|
|
*
|
|
* Reference ISO-C11 Implementation of the LEDAcrypt KEM-LT cipher using GCC built-ins.
|
|
*
|
|
* In alphabetical order:
|
|
*
|
|
* @author Marco Baldi <m.baldi@univpm.it>
|
|
* @author Alessandro Barenghi <alessandro.barenghi@polimi.it>
|
|
* @author Franco Chiaraluce <f.chiaraluce@univpm.it>
|
|
* @author Gerardo Pelosi <gerardo.pelosi@polimi.it>
|
|
* @author Paolo Santini <p.santini@pm.univpm.it>
|
|
*
|
|
* This code is hereby placed in the public domain.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY EXPRESS
|
|
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
|
|
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
|
|
* OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
|
|
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
**/
|
|
|
|
#pragma once
|
|
#include "qc_ldpc_parameters.h"
|
|
#include "gf2x_limbs.h"
|
|
#include "gf2x_arith_mod_xPplusOne.h"
|
|
|
|
|
|
/*----------------------------------------------------------------------------*/
|
|
#pragma pack(1)
|
|
|
|
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;
|
|
|
|
#pragma pack()
|
|
/*----------------------------------------------------------------------------*/
|