1
1
дзеркало https://github.com/henrydcase/pqc.git synced 2024-11-22 07:35:38 +00:00
This commit is contained in:
John M. Schanck 2020-09-15 17:23:57 -04:00 зафіксовано Kris Kwiatkowski
джерело 82ae2d3e34
коміт 6154c0d7d3
28 змінених файлів з 112 додано та 56 видалено

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM1344AES_CLEAN_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM1344AES_OPT_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM1344SHAKE_CLEAN_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM1344SHAKE_OPT_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM640AES_CLEAN_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM640AES_OPT_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM640SHAKE_CLEAN_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM640SHAKE_OPT_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM976AES_CLEAN_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM976AES_OPT_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM976SHAKE_CLEAN_LE_TO_UINT16(uint16_t n) {

@ -12,8 +12,10 @@
#include "params.h"
static inline uint8_t min(uint8_t x, uint8_t y) {
if (x < y) return x;
return y;
if (x < y) {
return x;
}
return y;
}
uint16_t PQCLEAN_FRODOKEM976SHAKE_OPT_LE_TO_UINT16(uint16_t n) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, size_t n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {

@ -463,8 +463,10 @@ static void int32_sort_2power(int32 *x, long long n, int flagdown) {
q = n >> 3;
flip = 0;
if (p << 1 == q) flip = 1;
flipflip = 1-flip;
if (p << 1 == q) {
flip = 1;
}
flipflip = 1 - flip;
for (j = 0; j < q; j += p + p) {
for (k = j; k < j + p + p; k += p) {
for (i = k; i < k + p; i += 8) {