mirror of
https://github.com/henrydcase/pqc.git
synced 2024-11-26 17:31:38 +00:00
112 lines
3.3 KiB
C
112 lines
3.3 KiB
C
#include "cbd.h"
|
|
|
|
/*************************************************
|
|
* Name: load_littleendian
|
|
*
|
|
* Description: load bytes into a 64-bit integer
|
|
* in little-endian order
|
|
*
|
|
* Arguments: - const unsigned char *x: pointer to input byte array
|
|
* - bytes: number of bytes to load, has to be <=
|
|
*8
|
|
*
|
|
* Returns 64-bit unsigned integer loaded from x
|
|
**************************************************/
|
|
static uint64_t load_littleendian(const unsigned char *x, int bytes) {
|
|
int i;
|
|
uint64_t r = x[0];
|
|
for (i = 1; i < bytes; i++) {
|
|
r |= (uint64_t)x[i] << (8 * i);
|
|
}
|
|
return r;
|
|
}
|
|
|
|
/*************************************************
|
|
* Name: cbd
|
|
*
|
|
* Description: Given an array of uniformly random bytes, compute
|
|
* polynomial with coefficients distributed according to
|
|
* a centered binomial distribution with parameter KYBER_ETA
|
|
*
|
|
* Arguments: - poly *r: pointer to output polynomial
|
|
* - const unsigned char *buf: pointer to input byte array
|
|
**************************************************/
|
|
void PQCLEAN_KYBER768_cbd(poly *r, const unsigned char *buf) {
|
|
#if KYBER_ETA == 3
|
|
uint32_t t, d, a[4], b[4];
|
|
int i, j;
|
|
|
|
for (i = 0; i < KYBER_N / 4; i++) {
|
|
t = load_littleendian(buf + 3 * i, 3);
|
|
d = 0;
|
|
for (j = 0; j < 3; j++)
|
|
d += (t >> j) & 0x249249;
|
|
|
|
a[0] = d & 0x7;
|
|
b[0] = (d >> 3) & 0x7;
|
|
a[1] = (d >> 6) & 0x7;
|
|
b[1] = (d >> 9) & 0x7;
|
|
a[2] = (d >> 12) & 0x7;
|
|
b[2] = (d >> 15) & 0x7;
|
|
a[3] = (d >> 18) & 0x7;
|
|
b[3] = (d >> 21);
|
|
|
|
r->coeffs[4 * i + 0] = a[0] + KYBER_Q - b[0];
|
|
r->coeffs[4 * i + 1] = a[1] + KYBER_Q - b[1];
|
|
r->coeffs[4 * i + 2] = a[2] + KYBER_Q - b[2];
|
|
r->coeffs[4 * i + 3] = a[3] + KYBER_Q - b[3];
|
|
}
|
|
#elif KYBER_ETA == 4
|
|
uint32_t t, d, a[4], b[4];
|
|
int i, j;
|
|
|
|
for (i = 0; i < KYBER_N / 4; i++) {
|
|
t = load_littleendian(buf + 4 * i, 4);
|
|
d = 0;
|
|
for (j = 0; j < 4; j++) {
|
|
d += (t >> j) & 0x11111111;
|
|
}
|
|
|
|
a[0] = d & 0xf;
|
|
b[0] = (d >> 4) & 0xf;
|
|
a[1] = (d >> 8) & 0xf;
|
|
b[1] = (d >> 12) & 0xf;
|
|
a[2] = (d >> 16) & 0xf;
|
|
b[2] = (d >> 20) & 0xf;
|
|
a[3] = (d >> 24) & 0xf;
|
|
b[3] = (d >> 28);
|
|
|
|
r->coeffs[4 * i + 0] = a[0] + KYBER_Q - b[0];
|
|
r->coeffs[4 * i + 1] = a[1] + KYBER_Q - b[1];
|
|
r->coeffs[4 * i + 2] = a[2] + KYBER_Q - b[2];
|
|
r->coeffs[4 * i + 3] = a[3] + KYBER_Q - b[3];
|
|
}
|
|
#elif KYBER_ETA == 5
|
|
uint64_t t, d, a[4], b[4];
|
|
int i, j;
|
|
|
|
for (i = 0; i < KYBER_N / 4; i++) {
|
|
t = load_littleendian(buf + 5 * i, 5);
|
|
d = 0;
|
|
for (j = 0; j < 5; j++)
|
|
d += (t >> j) & 0x0842108421UL;
|
|
|
|
a[0] = d & 0x1f;
|
|
b[0] = (d >> 5) & 0x1f;
|
|
a[1] = (d >> 10) & 0x1f;
|
|
b[1] = (d >> 15) & 0x1f;
|
|
a[2] = (d >> 20) & 0x1f;
|
|
b[2] = (d >> 25) & 0x1f;
|
|
a[3] = (d >> 30) & 0x1f;
|
|
b[3] = (d >> 35);
|
|
|
|
r->coeffs[4 * i + 0] = a[0] + KYBER_Q - b[0];
|
|
r->coeffs[4 * i + 1] = a[1] + KYBER_Q - b[1];
|
|
r->coeffs[4 * i + 2] = a[2] + KYBER_Q - b[2];
|
|
r->coeffs[4 * i + 3] = a[3] + KYBER_Q - b[3];
|
|
}
|
|
#else
|
|
#error "poly_getnoise in poly.c only supports eta in {3,4,5}"
|
|
#endif
|
|
}
|