1
1
mirror of https://github.com/henrydcase/pqc.git synced 2024-11-30 03:11:43 +00:00
pqcrypto/crypto_kem/sntrup857/clean/crypto_encode_857x1723.c
John M. Schanck 431dbada45 Add sntrup{653,761,857} and ntrulpr{653,761,857}
Exported from SUPERCOP-20200826 using the scripts at:
https://github.com/jschanck/pqclean-package-ntruprime
2021-03-24 21:02:46 +00:00

131 lines
2.7 KiB
C

#include "crypto_encode_857x1723.h"
/* auto-generated; do not edit */
#define int16 int16_t
#define uint16 uint16_t
#define uint32 uint32_t
void PQCLEAN_SNTRUP857_CLEAN_crypto_encode_857x1723(unsigned char *out, const void *v) {
const int16 *R0 = v;
/* XXX: caller could overlap R with input */
uint16 R[429];
long i;
uint16 r0, r1;
uint32 r2;
for (i = 0; i < 428; ++i) {
r0 = (((R0[2 * i] + 2583) & 16383) * 10923) >> 15;
r1 = (((R0[2 * i + 1] + 2583) & 16383) * 10923) >> 15;
r2 = r0 + r1 * (uint32)1723;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
R[428] = (((R0[856] + 2583) & 16383) * 10923) >> 15;
for (i = 0; i < 214; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)11597;
*out++ = r2;
r2 >>= 8;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
R[214] = R[428];
for (i = 0; i < 107; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)2053;
*out++ = r2;
r2 >>= 8;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
R[107] = R[214];
for (i = 0; i < 53; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)65;
R[i] = r2;
}
r0 = R[106];
r1 = R[107];
r2 = r0 + r1 * (uint32)65;
*out++ = r2;
r2 >>= 8;
R[53] = r2;
for (i = 0; i < 26; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)4225;
*out++ = r2;
r2 >>= 8;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
r0 = R[52];
r1 = R[53];
r2 = r0 + r1 * (uint32)4225;
*out++ = r2;
r2 >>= 8;
R[26] = r2;
for (i = 0; i < 13; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)273;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
R[13] = R[26];
for (i = 0; i < 7; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)292;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
for (i = 0; i < 3; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)334;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
R[3] = R[6];
for (i = 0; i < 2; ++i) {
r0 = R[2 * i];
r1 = R[2 * i + 1];
r2 = r0 + r1 * (uint32)436;
*out++ = r2;
r2 >>= 8;
R[i] = r2;
}
r0 = R[0];
r1 = R[1];
r2 = r0 + r1 * (uint32)743;
*out++ = r2;
r2 >>= 8;
*out++ = r2;
r2 >>= 8;
R[0] = r2;
r0 = R[0];
*out++ = r0; /*clang-analyzer-deadcode.DeadStores*/ /*r0 >>= 8;*/
}