mirror of
https://github.com/open-quantum-safe/liboqs.git
synced 2025-10-04 00:02:01 -04:00
Run copy_from_upstream
This commit is contained in:
parent
2336702600
commit
1356ad102a
@ -51,6 +51,7 @@
|
||||
void poly_compress(uint8_t r[KYBER_POLYCOMPRESSEDBYTES], const int16_t a[KYBER_N]) {
|
||||
unsigned int i, j;
|
||||
int16_t u;
|
||||
uint32_t d0;
|
||||
uint8_t t[8];
|
||||
|
||||
for (i = 0; i < KYBER_N / 8; i++) {
|
||||
@ -58,7 +59,12 @@ void poly_compress(uint8_t r[KYBER_POLYCOMPRESSEDBYTES], const int16_t a[KYBER_N
|
||||
// map to positive standard representatives
|
||||
u = a[8 * i + j];
|
||||
u += (u >> 15) & KYBER_Q;
|
||||
t[j] = ((((uint32_t)u << 5) + KYBER_Q / 2) / KYBER_Q) & 31;
|
||||
// t[j] = ((((uint32_t)u << 5) + KYBER_Q / 2) / KYBER_Q) & 31;
|
||||
d0 = u << 5;
|
||||
d0 += 1664;
|
||||
d0 *= 40318;
|
||||
d0 >>= 27;
|
||||
t[j] = d0 & 0x1f;
|
||||
}
|
||||
|
||||
r[0] = (t[0] >> 0) | (t[1] << 5);
|
||||
|
@ -21,6 +21,7 @@
|
||||
**************************************************/
|
||||
void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K][KYBER_N]) {
|
||||
unsigned int i, j, k;
|
||||
uint64_t d0;
|
||||
|
||||
#if (KYBER_POLYVECCOMPRESSEDBYTES == (KYBER_K * 352))
|
||||
uint16_t t[8];
|
||||
@ -29,7 +30,13 @@ void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K
|
||||
for (k = 0; k < 8; k++) {
|
||||
t[k] = a[i][8 * j + k];
|
||||
t[k] += ((int16_t)t[k] >> 15) & KYBER_Q;
|
||||
t[k] = ((((uint32_t)t[k] << 11) + KYBER_Q / 2) / KYBER_Q) & 0x7ff;
|
||||
// t[k] = ((((uint32_t)t[k] << 11) + KYBER_Q / 2) / KYBER_Q) & 0x7ff;
|
||||
d0 = t[k];
|
||||
d0 <<= 11;
|
||||
d0 += 1664;
|
||||
d0 *= 645084;
|
||||
d0 >>= 31;
|
||||
t[k] = d0 & 0x7ff;
|
||||
}
|
||||
|
||||
r[ 0] = (t[0] >> 0);
|
||||
@ -53,7 +60,13 @@ void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K
|
||||
for (k = 0; k < 4; k++) {
|
||||
t[k] = a[i][4 * j + k];
|
||||
t[k] += ((int16_t)t[k] >> 15) & KYBER_Q;
|
||||
t[k] = ((((uint32_t)t[k] << 10) + KYBER_Q / 2) / KYBER_Q) & 0x3ff;
|
||||
// t[k] = ((((uint32_t)t[k] << 10) + KYBER_Q / 2) / KYBER_Q) & 0x3ff;
|
||||
d0 = t[k];
|
||||
d0 <<= 10;
|
||||
d0 += 1665;
|
||||
d0 *= 1290167;
|
||||
d0 >>= 32;
|
||||
t[k] = d0 & 0x3ff;
|
||||
}
|
||||
|
||||
r[0] = (t[0] >> 0);
|
||||
|
@ -51,6 +51,7 @@
|
||||
void poly_compress(uint8_t r[KYBER_POLYCOMPRESSEDBYTES], const int16_t a[KYBER_N]) {
|
||||
unsigned int i, j;
|
||||
int16_t u;
|
||||
uint32_t d0;
|
||||
uint8_t t[8];
|
||||
|
||||
for (i = 0; i < KYBER_N / 8; i++) {
|
||||
@ -58,7 +59,12 @@ void poly_compress(uint8_t r[KYBER_POLYCOMPRESSEDBYTES], const int16_t a[KYBER_N
|
||||
// map to positive standard representatives
|
||||
u = a[8 * i + j];
|
||||
u += (u >> 15) & KYBER_Q;
|
||||
t[j] = ((((uint16_t)u << 4) + KYBER_Q / 2) / KYBER_Q) & 15;
|
||||
// t[j] = ((((uint16_t)u << 4) + KYBER_Q / 2) / KYBER_Q) & 15;
|
||||
d0 = u << 4;
|
||||
d0 += 1665;
|
||||
d0 *= 80635;
|
||||
d0 >>= 28;
|
||||
t[j] = d0 & 0xf;
|
||||
}
|
||||
|
||||
r[0] = t[0] | (t[1] << 4);
|
||||
|
@ -21,6 +21,7 @@
|
||||
**************************************************/
|
||||
void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K][KYBER_N]) {
|
||||
unsigned int i, j, k;
|
||||
uint64_t d0;
|
||||
|
||||
#if (KYBER_POLYVECCOMPRESSEDBYTES == (KYBER_K * 352))
|
||||
uint16_t t[8];
|
||||
@ -29,7 +30,13 @@ void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K
|
||||
for (k = 0; k < 8; k++) {
|
||||
t[k] = a[i][8 * j + k];
|
||||
t[k] += ((int16_t)t[k] >> 15) & KYBER_Q;
|
||||
t[k] = ((((uint32_t)t[k] << 11) + KYBER_Q / 2) / KYBER_Q) & 0x7ff;
|
||||
// t[k] = ((((uint32_t)t[k] << 11) + KYBER_Q / 2) / KYBER_Q) & 0x7ff;
|
||||
d0 = t[k];
|
||||
d0 <<= 11;
|
||||
d0 += 1664;
|
||||
d0 *= 645084;
|
||||
d0 >>= 31;
|
||||
t[k] = d0 & 0x7ff;
|
||||
}
|
||||
|
||||
r[ 0] = (t[0] >> 0);
|
||||
@ -53,7 +60,13 @@ void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K
|
||||
for (k = 0; k < 4; k++) {
|
||||
t[k] = a[i][4 * j + k];
|
||||
t[k] += ((int16_t)t[k] >> 15) & KYBER_Q;
|
||||
t[k] = ((((uint32_t)t[k] << 10) + KYBER_Q / 2) / KYBER_Q) & 0x3ff;
|
||||
// t[k] = ((((uint32_t)t[k] << 10) + KYBER_Q / 2) / KYBER_Q) & 0x3ff;
|
||||
d0 = t[k];
|
||||
d0 <<= 10;
|
||||
d0 += 1665;
|
||||
d0 *= 1290167;
|
||||
d0 >>= 32;
|
||||
t[k] = d0 & 0x3ff;
|
||||
}
|
||||
|
||||
r[0] = (t[0] >> 0);
|
||||
|
@ -51,6 +51,7 @@
|
||||
void poly_compress(uint8_t r[KYBER_POLYCOMPRESSEDBYTES], const int16_t a[KYBER_N]) {
|
||||
unsigned int i, j;
|
||||
int16_t u;
|
||||
uint32_t d0;
|
||||
uint8_t t[8];
|
||||
|
||||
for (i = 0; i < KYBER_N / 8; i++) {
|
||||
@ -58,7 +59,12 @@ void poly_compress(uint8_t r[KYBER_POLYCOMPRESSEDBYTES], const int16_t a[KYBER_N
|
||||
// map to positive standard representatives
|
||||
u = a[8 * i + j];
|
||||
u += (u >> 15) & KYBER_Q;
|
||||
t[j] = ((((uint16_t)u << 4) + KYBER_Q / 2) / KYBER_Q) & 15;
|
||||
// t[j] = ((((uint16_t)u << 4) + KYBER_Q / 2) / KYBER_Q) & 15;
|
||||
d0 = u << 4;
|
||||
d0 += 1665;
|
||||
d0 *= 80635;
|
||||
d0 >>= 28;
|
||||
t[j] = d0 & 0xf;
|
||||
}
|
||||
|
||||
r[0] = t[0] | (t[1] << 4);
|
||||
|
@ -21,6 +21,7 @@
|
||||
**************************************************/
|
||||
void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K][KYBER_N]) {
|
||||
unsigned int i, j, k;
|
||||
uint64_t d0;
|
||||
|
||||
#if (KYBER_POLYVECCOMPRESSEDBYTES == (KYBER_K * 352))
|
||||
uint16_t t[8];
|
||||
@ -29,7 +30,13 @@ void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K
|
||||
for (k = 0; k < 8; k++) {
|
||||
t[k] = a[i][8 * j + k];
|
||||
t[k] += ((int16_t)t[k] >> 15) & KYBER_Q;
|
||||
t[k] = ((((uint32_t)t[k] << 11) + KYBER_Q / 2) / KYBER_Q) & 0x7ff;
|
||||
// t[k] = ((((uint32_t)t[k] << 11) + KYBER_Q / 2) / KYBER_Q) & 0x7ff;
|
||||
d0 = t[k];
|
||||
d0 <<= 11;
|
||||
d0 += 1664;
|
||||
d0 *= 645084;
|
||||
d0 >>= 31;
|
||||
t[k] = d0 & 0x7ff;
|
||||
}
|
||||
|
||||
r[ 0] = (t[0] >> 0);
|
||||
@ -53,7 +60,13 @@ void polyvec_compress(uint8_t r[KYBER_POLYVECCOMPRESSEDBYTES], int16_t a[KYBER_K
|
||||
for (k = 0; k < 4; k++) {
|
||||
t[k] = a[i][4 * j + k];
|
||||
t[k] += ((int16_t)t[k] >> 15) & KYBER_Q;
|
||||
t[k] = ((((uint32_t)t[k] << 10) + KYBER_Q / 2) / KYBER_Q) & 0x3ff;
|
||||
// t[k] = ((((uint32_t)t[k] << 10) + KYBER_Q / 2) / KYBER_Q) & 0x3ff;
|
||||
d0 = t[k];
|
||||
d0 <<= 10;
|
||||
d0 += 1665;
|
||||
d0 *= 1290167;
|
||||
d0 >>= 32;
|
||||
t[k] = d0 & 0x3ff;
|
||||
}
|
||||
|
||||
r[0] = (t[0] >> 0);
|
||||
|
Loading…
x
Reference in New Issue
Block a user