kris
/
pqcrypto
mirror of https://github.com/henrydcase/pqc.git
1
1
Fork 0
Code Issues 1 Releases 2 Wiki Activity
Browse Source

NTRU Prime: change prototype for clean/crypto_sort_int32

undefined
John M. Schanck 4 years ago
parent
4f6e00ed69
commit
8a372ad2e8
12 changed files with 12 additions and 12 deletions
Unified View
Diff Options
Show Stats Download Patch File Download Diff File
  1. +1
    -1
      crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
  2. +1
    -1
      crypto_kem/ntrulpr653/clean/crypto_sort_int32.h
  3. +1
    -1
      crypto_kem/ntrulpr761/clean/crypto_sort_int32.c
  4. +1
    -1
      crypto_kem/ntrulpr761/clean/crypto_sort_int32.h
  5. +1
    -1
      crypto_kem/ntrulpr857/clean/crypto_sort_int32.c
  6. +1
    -1
      crypto_kem/ntrulpr857/clean/crypto_sort_int32.h
  7. +1
    -1
      crypto_kem/sntrup653/clean/crypto_sort_int32.c
  8. +1
    -1
      crypto_kem/sntrup653/clean/crypto_sort_int32.h
  9. +1
    -1
      crypto_kem/sntrup761/clean/crypto_sort_int32.c
  10. +1
    -1
      crypto_kem/sntrup761/clean/crypto_sort_int32.h
  11. +1
    -1
      crypto_kem/sntrup857/clean/crypto_sort_int32.c
  12. +1
    -1
      crypto_kem/sntrup857/clean/crypto_sort_int32.h

+ 1
- 1
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;


+ 1
- 1
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

+ 1
- 1
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;


+ 1
- 1
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

+ 1
- 1
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;


+ 1
- 1
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

+ 1
- 1
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;


+ 1
- 1
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

+ 1
- 1
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;


+ 1
- 1
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

+ 1
- 1
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;


+ 1
- 1
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

Write Preview
Loading…
Cancel
Save