kris/pqc
1
1
Fork 0
Code Issues Pull Requests Releases Wiki Activity

NTRU Prime: change prototype for clean/crypto_sort_int32

Browse Source
This commit is contained in:
John M. Schanck 2020-09-02 16:41:51 -04:00 committed by Kris Kwiatkowski
parent 162751e2e5
commit fee8635c9f
12 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
View File

@ -15,7 +15,7 @@
} while(0) } while(0)
/* assume 2 <= n <= 0x40000000 */ /* assume 2 <= n <= 0x40000000 */
void PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32(int32_t *x, long long n) { void PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32(int32_t *x, int32_t n) {
int32 top, p, q, r, i, j; int32 top, p, q, r, i, j;
top = 1; top = 1;

2
crypto_kem/ntrulpr653/clean/crypto_sort_int32.h
View File

@ -4,5 +4,5 @@
#include <stdint.h> #include <stdint.h>
#define PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32_BYTES 4 #define PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32(int32_t *x, long long n); void PQCLEAN_NTRULPR653_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif #endif

2
crypto_kem/ntrulpr761/clean/crypto_sort_int32.c
View File

@ -15,7 +15,7 @@
} while(0) } while(0)
/* assume 2 <= n <= 0x40000000 */ /* assume 2 <= n <= 0x40000000 */
void PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32(int32_t *x, long long n) { void PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32(int32_t *x, int32_t n) {
int32 top, p, q, r, i, j; int32 top, p, q, r, i, j;
top = 1; top = 1;

2
crypto_kem/ntrulpr761/clean/crypto_sort_int32.h
View File

@ -4,5 +4,5 @@
#include <stdint.h> #include <stdint.h>
#define PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32_BYTES 4 #define PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32(int32_t *x, long long n); void PQCLEAN_NTRULPR761_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif #endif

2
crypto_kem/ntrulpr857/clean/crypto_sort_int32.c
View File

@ -15,7 +15,7 @@
} while(0) } while(0)
/* assume 2 <= n <= 0x40000000 */ /* assume 2 <= n <= 0x40000000 */
void PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32(int32_t *x, long long n) { void PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32(int32_t *x, int32_t n) {
int32 top, p, q, r, i, j; int32 top, p, q, r, i, j;
top = 1; top = 1;

2
crypto_kem/ntrulpr857/clean/crypto_sort_int32.h
View File

@ -4,5 +4,5 @@
#include <stdint.h> #include <stdint.h>
#define PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32_BYTES 4 #define PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32(int32_t *x, long long n); void PQCLEAN_NTRULPR857_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif #endif

2
crypto_kem/sntrup653/clean/crypto_sort_int32.c
View File

@ -15,7 +15,7 @@
} while(0) } while(0)
/* assume 2 <= n <= 0x40000000 */ /* assume 2 <= n <= 0x40000000 */
void PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32(int32_t *x, long long n) { void PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32(int32_t *x, int32_t n) {
int32 top, p, q, r, i, j; int32 top, p, q, r, i, j;
top = 1; top = 1;

2
crypto_kem/sntrup653/clean/crypto_sort_int32.h
View File

@ -4,5 +4,5 @@
#include <stdint.h> #include <stdint.h>
#define PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32_BYTES 4 #define PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32(int32_t *x, long long n); void PQCLEAN_SNTRUP653_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif #endif

2
crypto_kem/sntrup761/clean/crypto_sort_int32.c
View File

@ -15,7 +15,7 @@
} while(0) } while(0)
/* assume 2 <= n <= 0x40000000 */ /* assume 2 <= n <= 0x40000000 */
void PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32(int32_t *x, long long n) { void PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32(int32_t *x, int32_t n) {
int32 top, p, q, r, i, j; int32 top, p, q, r, i, j;
top = 1; top = 1;

2
crypto_kem/sntrup761/clean/crypto_sort_int32.h
View File

@ -4,5 +4,5 @@
#include <stdint.h> #include <stdint.h>
#define PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32_BYTES 4 #define PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32(int32_t *x, long long n); void PQCLEAN_SNTRUP761_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif #endif

2
crypto_kem/sntrup857/clean/crypto_sort_int32.c
View File

@ -15,7 +15,7 @@
} while(0) } while(0)
/* assume 2 <= n <= 0x40000000 */ /* assume 2 <= n <= 0x40000000 */
void PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32(int32_t *x, long long n) { void PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32(int32_t *x, int32_t n) {
int32 top, p, q, r, i, j; int32 top, p, q, r, i, j;
top = 1; top = 1;

2
crypto_kem/sntrup857/clean/crypto_sort_int32.h
View File

@ -4,5 +4,5 @@
#include <stdint.h> #include <stdint.h>
#define PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32_BYTES 4 #define PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32_BYTES 4
void PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32(int32_t *x, long long n); void PQCLEAN_SNTRUP857_CLEAN_crypto_sort_int32(int32_t *x, int32_t n);
#endif #endif