mirror of
https://github.com/luxfi/crypto.git
synced 2026-11-02 13:34:37 +00:00
zeekay
cc84032371
Replaces the stub backend (ErrBackendNotWired) with a working byte-
for-byte NIST-compatible HQC implementation. Build tag hqc_pqclean
activates the cgo path; default builds remain stub for portability.
Vendored:
- PQClean HQC-128/192/256 clean reference C (2023-04-30 NIST
submission), public domain
- PQClean shared fips202 (SHA-3 / SHAKE)
- Per-mode/per-source shim TUs (36 total) to keep PQClean's
static helpers isolated and avoid duplicate-symbol collisions
- randombytes_shim.c wiring PQClean's randombytes() to a Go-side
io.Reader callback, mutex-protected for concurrent dispatch
Tests:
- TestKAT_HQC128/192/256 — all three NIST KAT vectors verified
byte-for-byte against META.yml nistkat-sha256
- TestRoundTrip_AllModes — keygen → encap → decap roundtrip,
shared secrets byte-equal in all 3 modes
- TestDeterminism_AllModes — same seed produces identical ct/ss
(load-bearing for the precompile's on-chain determinism)
- -race clean
Correction: ciphertext sizes updated from 4481/9026/14469 (older
HQC round-3 listing) to PQClean's 4433/8978/14421 (2023-04-30 NIST
submission); the prior numbers would have failed round-trip with
a 48-byte mismatch.
97 lines
5.9 KiB
C
97 lines
5.9 KiB
C
#ifndef HQC_PARAMETERS_H
|
|
#define HQC_PARAMETERS_H
|
|
|
|
|
|
/**
|
|
* @file parameters.h
|
|
* @brief Parameters of the HQC_KEM IND-CCA2 scheme
|
|
*/
|
|
#include "api.h"
|
|
|
|
|
|
#define CEIL_DIVIDE(a, b) (((a)+(b)-1)/(b)) /*!< Divide a by b and ceil the result*/
|
|
|
|
/*
|
|
#define PARAM_N Define the parameter n of the scheme
|
|
#define PARAM_N1 Define the parameter n1 of the scheme (length of Reed-Solomon code)
|
|
#define PARAM_N2 Define the parameter n2 of the scheme (length of Duplicated Reed-Muller code)
|
|
#define PARAM_N1N2 Define the length in bits of the Concatenated code
|
|
#define PARAM_OMEGA Define the parameter omega of the scheme
|
|
#define PARAM_OMEGA_E Define the parameter omega_e of the scheme
|
|
#define PARAM_OMEGA_R Define the parameter omega_r of the scheme
|
|
|
|
#define SECRET_KEY_BYTES Define the size of the secret key in bytes
|
|
#define PUBLIC_KEY_BYTES Define the size of the public key in bytes
|
|
#define SHARED_SECRET_BYTES Define the size of the shared secret in bytes
|
|
#define CIPHERTEXT_BYTES Define the size of the ciphertext in bytes
|
|
|
|
#define VEC_N_SIZE_BYTES Define the size of the array used to store a PARAM_N sized vector in bytes
|
|
#define VEC_K_SIZE_BYTES Define the size of the array used to store a PARAM_K sized vector in bytes
|
|
#define VEC_N1_SIZE_BYTES Define the size of the array used to store a PARAM_N1 sized vector in bytes
|
|
#define VEC_N1N2_SIZE_BYTES Define the size of the array used to store a PARAM_N1N2 sized vector in bytes
|
|
|
|
#define VEC_N_SIZE_64 Define the size of the array used to store a PARAM_N sized vector in 64 bits
|
|
#define VEC_K_SIZE_64 Define the size of the array used to store a PARAM_K sized vector in 64 bits
|
|
#define VEC_N1_SIZE_64 Define the size of the array used to store a PARAM_N1 sized vector in 64 bits
|
|
#define VEC_N1N2_SIZE_64 Define the size of the array used to store a PARAM_N1N2 sized vector in 64 bits
|
|
|
|
#define PARAM_DELTA Define the parameter delta of the scheme (correcting capacity of the Reed-Solomon code)
|
|
#define PARAM_M Define a positive integer
|
|
#define PARAM_GF_POLY Generator polynomial of galois field GF(2^PARAM_M), represented in hexadecimial form
|
|
#define PARAM_GF_POLY_WT Hamming weight of PARAM_GF_POLY
|
|
#define PARAM_GF_POLY_M2 Distance between the primitive polynomial first two set bits
|
|
#define PARAM_GF_MUL_ORDER Define the size of the multiplicative group of GF(2^PARAM_M), i.e 2^PARAM_M -1
|
|
#define PARAM_K Define the size of the information bits of the Reed-Solomon code
|
|
#define PARAM_G Define the size of the generator polynomial of Reed-Solomon code
|
|
#define PARAM_FFT The additive FFT takes a 2^PARAM_FFT polynomial as input
|
|
We use the FFT to compute the roots of sigma, whose degree if PARAM_DELTA=24
|
|
The smallest power of 2 greater than 24+1 is 32=2^5
|
|
#define RS_POLY_COEFS Coefficients of the generator polynomial of the Reed-Solomon code
|
|
|
|
#define RED_MASK A mask for the higher bits of a vector
|
|
#define SHAKE256_512_BYTES Define the size of SHAKE-256 output in bytes
|
|
#define SEED_BYTES Define the size of the seed in bytes
|
|
#define SALT_SIZE_BYTES Define the size of a salt in bytes
|
|
*/
|
|
|
|
#define PARAM_N 17669
|
|
#define PARAM_N1 46
|
|
#define PARAM_N2 384
|
|
#define PARAM_N1N2 17664
|
|
#define PARAM_OMEGA 66
|
|
#define PARAM_OMEGA_E 75
|
|
#define PARAM_OMEGA_R 75
|
|
|
|
#define SECRET_KEY_BYTES PQCLEAN_HQC128_CLEAN_CRYPTO_SECRETKEYBYTES
|
|
#define PUBLIC_KEY_BYTES PQCLEAN_HQC128_CLEAN_CRYPTO_PUBLICKEYBYTES
|
|
#define SHARED_SECRET_BYTES PQCLEAN_HQC128_CLEAN_CRYPTO_BYTES
|
|
#define CIPHERTEXT_BYTES PQCLEAN_HQC128_CLEAN_CRYPTO_CIPHERTEXTBYTES
|
|
|
|
#define VEC_N_SIZE_BYTES CEIL_DIVIDE(PARAM_N, 8)
|
|
#define VEC_K_SIZE_BYTES PARAM_K
|
|
#define VEC_N1_SIZE_BYTES PARAM_N1
|
|
#define VEC_N1N2_SIZE_BYTES CEIL_DIVIDE(PARAM_N1N2, 8)
|
|
|
|
#define VEC_N_SIZE_64 CEIL_DIVIDE(PARAM_N, 64)
|
|
#define VEC_K_SIZE_64 CEIL_DIVIDE(PARAM_K, 8)
|
|
#define VEC_N1_SIZE_64 CEIL_DIVIDE(PARAM_N1, 8)
|
|
#define VEC_N1N2_SIZE_64 CEIL_DIVIDE(PARAM_N1N2, 64)
|
|
|
|
#define PARAM_DELTA 15
|
|
#define PARAM_M 8
|
|
#define PARAM_GF_POLY 0x11D
|
|
#define PARAM_GF_POLY_WT 5
|
|
#define PARAM_GF_POLY_M2 4
|
|
#define PARAM_GF_MUL_ORDER 255
|
|
#define PARAM_K 16
|
|
#define PARAM_G 31
|
|
#define PARAM_FFT 4
|
|
#define RS_POLY_COEFS 89,69,153,116,176,117,111,75,73,233,242,233,65,210,21,139,103,173,67,118,105,210,174,110,74,69,228,82,255,181,1
|
|
|
|
#define RED_MASK 0x1f
|
|
#define SHAKE256_512_BYTES 64
|
|
#define SEED_BYTES 40
|
|
#define SALT_SIZE_BYTES 16
|
|
|
|
#endif
|