kris/pqc
1
1
Förgrening 0
Kod Ärenden Pull-förfrågningar Släpp Wiki Aktiviteter

NTRU Prime: change prototype for clean/crypto_sort_int32

Bläddra i källkod
This commit is contained in:
John M. Schanck 2020-09-02 16:41:51 -04:00
förälder 4f6e00ed69
incheckning 8a372ad2e8
12 ändrade filer med 12 tillägg och 12 borttagningar
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
Visa fil

@ -15,7 +15,7 @@
} while(0)
/* 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;
top = 1;

2
crypto_kem/ntrulpr653/clean/crypto_sort_int32.h
Visa fil

@ -4,5 +4,5 @@
#include <stdint.h>
#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

2
crypto_kem/ntrulpr761/clean/crypto_sort_int32.c
Visa fil

@ -15,7 +15,7 @@
} while(0)
/* 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;
top = 1;

2
crypto_kem/ntrulpr761/clean/crypto_sort_int32.h
Visa fil

@ -4,5 +4,5 @@
#include <stdint.h>
#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

2
crypto_kem/ntrulpr857/clean/crypto_sort_int32.c
Visa fil

@ -15,7 +15,7 @@
} while(0)
/* 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;
top = 1;

2
crypto_kem/ntrulpr857/clean/crypto_sort_int32.h
Visa fil

@ -4,5 +4,5 @@
#include <stdint.h>
#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

2
crypto_kem/sntrup653/clean/crypto_sort_int32.c
Visa fil

@ -15,7 +15,7 @@
} while(0)
/* 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;
top = 1;

2
crypto_kem/sntrup653/clean/crypto_sort_int32.h
Visa fil

@ -4,5 +4,5 @@
#include <stdint.h>
#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

2
crypto_kem/sntrup761/clean/crypto_sort_int32.c
Visa fil

@ -15,7 +15,7 @@
} while(0)
/* 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;
top = 1;

2
crypto_kem/sntrup761/clean/crypto_sort_int32.h
Visa fil

@ -4,5 +4,5 @@
#include <stdint.h>
#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

2
crypto_kem/sntrup857/clean/crypto_sort_int32.c
Visa fil

@ -15,7 +15,7 @@
} while(0)
/* 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;
top = 1;

2
crypto_kem/sntrup857/clean/crypto_sort_int32.h
Visa fil

@ -4,5 +4,5 @@
#include <stdint.h>
#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