mirror of
https://github.com/henrydcase/pqc.git
synced 2024-11-26 17:31:38 +00:00
ac2c20045c
* Add McEliece reference implementations * Add Vec implementations of McEliece * Add sse implementations * Add AVX2 implementations * Get rid of stuff not supported by Mac ABI * restrict to two cores * Ditch .data files * Remove .hidden from all .S files * speed up duplicate consistency tests by batching * make cpuinfo more robust * Hope to stabilize macos cpuinfo without ccache * Revert "Hope to stabilize macos cpuinfo without ccache" This reverts commit 6129c3cabe1abbc8b956bc87e902a698e32bf322. * Just hardcode what's available at travis * Fixed-size types in api.h * namespace all header files in mceliece * Ditch operations.h * Get rid of static inline functions * fixup! Ditch operations.h
132 lines
2.9 KiB
C
132 lines
2.9 KiB
C
#include "vec.h"
|
|
|
|
#include "params.h"
|
|
|
|
vec PQCLEAN_MCELIECE348864_VEC_vec_setbits(vec b) {
|
|
vec ret = -b;
|
|
|
|
return ret;
|
|
}
|
|
|
|
vec PQCLEAN_MCELIECE348864_VEC_vec_set1_16b(uint16_t v) {
|
|
vec ret;
|
|
|
|
ret = v;
|
|
ret |= ret << 16;
|
|
ret |= ret << 32;
|
|
|
|
return ret;
|
|
}
|
|
|
|
void PQCLEAN_MCELIECE348864_VEC_vec_copy(vec *out, const vec *in) {
|
|
int i;
|
|
|
|
for (i = 0; i < GFBITS; i++) {
|
|
out[i] = in[i];
|
|
}
|
|
}
|
|
|
|
vec PQCLEAN_MCELIECE348864_VEC_vec_or_reduce(const vec *a) {
|
|
int i;
|
|
vec ret;
|
|
|
|
ret = a[0];
|
|
for (i = 1; i < GFBITS; i++) {
|
|
ret |= a[i];
|
|
}
|
|
|
|
return ret;
|
|
}
|
|
|
|
int PQCLEAN_MCELIECE348864_VEC_vec_testz(vec a) {
|
|
a |= a >> 32;
|
|
a |= a >> 16;
|
|
a |= a >> 8;
|
|
a |= a >> 4;
|
|
a |= a >> 2;
|
|
a |= a >> 1;
|
|
|
|
return ((int)a & 1) ^ 1;
|
|
}
|
|
|
|
void PQCLEAN_MCELIECE348864_VEC_vec_mul(vec *h, const vec *f, const vec *g) {
|
|
int i, j;
|
|
vec buf[ 2 * GFBITS - 1 ];
|
|
|
|
for (i = 0; i < 2 * GFBITS - 1; i++) {
|
|
buf[i] = 0;
|
|
}
|
|
|
|
for (i = 0; i < GFBITS; i++) {
|
|
for (j = 0; j < GFBITS; j++) {
|
|
buf[i + j] ^= f[i] & g[j];
|
|
}
|
|
}
|
|
|
|
for (i = 2 * GFBITS - 2; i >= GFBITS; i--) {
|
|
buf[i - GFBITS + 3] ^= buf[i];
|
|
buf[i - GFBITS + 0] ^= buf[i];
|
|
}
|
|
|
|
for (i = 0; i < GFBITS; i++) {
|
|
h[i] = buf[i];
|
|
}
|
|
}
|
|
|
|
/* bitsliced field squarings */
|
|
void PQCLEAN_MCELIECE348864_VEC_vec_sq(vec *out, const vec *in) {
|
|
int i;
|
|
uint64_t result[GFBITS];
|
|
|
|
//
|
|
|
|
result[0] = in[0] ^ in[6];
|
|
result[1] = in[11];
|
|
result[2] = in[1] ^ in[7];
|
|
result[3] = in[6];
|
|
result[4] = in[2] ^ in[11] ^ in[8];
|
|
result[5] = in[7];
|
|
result[6] = in[3] ^ in[9];
|
|
result[7] = in[8];
|
|
result[8] = in[4] ^ in[10];
|
|
result[9] = in[9];
|
|
result[10] = in[5] ^ in[11];
|
|
result[11] = in[10];
|
|
|
|
//
|
|
|
|
for (i = 0; i < GFBITS; i++) {
|
|
out[i] = result[i];
|
|
}
|
|
}
|
|
|
|
/* bitsliced field inverses */
|
|
void PQCLEAN_MCELIECE348864_VEC_vec_inv(vec *out, const vec *in) {
|
|
uint64_t tmp_11[GFBITS];
|
|
uint64_t tmp_1111[GFBITS];
|
|
|
|
PQCLEAN_MCELIECE348864_VEC_vec_copy(out, in);
|
|
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_mul(tmp_11, out, in); // 11
|
|
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, tmp_11);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_mul(tmp_1111, out, tmp_11); // 1111
|
|
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, tmp_1111);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_mul(out, out, tmp_1111); // 11111111
|
|
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_mul(out, out, tmp_11); // 1111111111
|
|
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out);
|
|
PQCLEAN_MCELIECE348864_VEC_vec_mul(out, out, in); // 11111111111
|
|
|
|
PQCLEAN_MCELIECE348864_VEC_vec_sq(out, out); // 111111111110
|
|
}
|