This website works better with JavaScript.
首頁
探索
說明
登入
kris
/
pqcrypto
镜像来自
https://github.com/henrydcase/pqc.git
關註
1
收藏
1
複製
0
程式碼
問題管理
1
版本發佈
2
Wiki
Activity
瀏覽代碼
NTRU Prime: change prototype for clean/crypto_sort_int32
undefined
John M. Schanck
4 年之前
父節點
4f6e00ed69
當前提交
8a372ad2e8
共有
12 個文件被更改
,包括
12 次插入
和
12 次删除
分割檢視
Diff Options
Show Stats
Download Patch File
Download Diff File
+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
Write
Preview
Loading…
取消
儲存