kris/pqc
1
1
派生 0
代码 工单 合并请求 版本发布 百科 动态

NTRU Prime: change prototype for clean/crypto_sort_int32

浏览代码
这个提交包含在：
John M. Schanck 2020-09-02 16:41:51 -04:00 提交者 Kris Kwiatkowski
父节点 162751e2e5
当前提交 fee8635c9f
共有 12 个文件被更改，包括 12 次插入 和 12 次删除
显示统计 下载 Patch 文件 下载 Diff 文件 展开所有文件 折叠所有文件

2
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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
查看文件

@ -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