使用 JavaScript能使本网站更好的工作。
首页
探索
帮助
登录
kris
/
pqcrypto
镜像自地址
https://github.com/henrydcase/pqc.git
关注
1
点赞
1
派生
0
代码
工单
1
版本发布
2
百科
动态
浏览代码
NTRU Prime: change prototype for clean/crypto_sort_int32
undefined
John M. Schanck
4 年前
父节点
4f6e00ed69
当前提交
8a372ad2e8
共有
12 个文件被更改
,包括
12 次插入
和
12 次删除
分列视图
Diff 选项
显示统计
下载 Patch 文件
下载 Diff 文件
+1
-1
crypto_kem/ntrulpr653/clean/crypto_sort_int32.c
+1
-1
crypto_kem/ntrulpr653/clean/crypto_sort_int32.h
+1
-1
crypto_kem/ntrulpr761/clean/crypto_sort_int32.c
+1
-1
crypto_kem/ntrulpr761/clean/crypto_sort_int32.h
+1
-1
crypto_kem/ntrulpr857/clean/crypto_sort_int32.c
+1
-1
crypto_kem/ntrulpr857/clean/crypto_sort_int32.h
+1
-1
crypto_kem/sntrup653/clean/crypto_sort_int32.c
+1
-1
crypto_kem/sntrup653/clean/crypto_sort_int32.h
+1
-1
crypto_kem/sntrup761/clean/crypto_sort_int32.c
+1
-1
crypto_kem/sntrup761/clean/crypto_sort_int32.h
+1
-1
crypto_kem/sntrup857/clean/crypto_sort_int32.c
+1
-1
crypto_kem/sntrup857/clean/crypto_sort_int32.h
+ 1
- 1
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;
+ 1
- 1
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
+ 1
- 1
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;
+ 1
- 1
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
+ 1
- 1
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;
+ 1
- 1
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
+ 1
- 1
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;
+ 1
- 1
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
+ 1
- 1
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;
+ 1
- 1
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
+ 1
- 1
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;
+ 1
- 1
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
撰写
预览
正在加载...
取消
保存